Apparatus and method for efficient process-based compartmentalization

ABSTRACT

An apparatus and method for efficient process-based compartmentalization. For example, one embodiment of a processor comprises: execution circuitry to execute instructions and process data; memory management circuitry coupled to the execution circuitry, the memory management circuitry to manage access to a system memory by a plurality of related processes using one or more process-specific translation structures and one or more shared translation structures to be shared by the related processes; and one or more control registers to store a process-specific base address pointer associated with a first process of the plurality of related processes and to store a shared base address pointer to identify the shared translation structures; wherein the memory management circuitry is to use the process-specific base address pointer in combination with a first linear address provided by the first process to walk the process-specific translation structures to identify any permissions and/or physical address associated with the first linear address, wherein if permissions are identified, the memory management circuitry is to use the permissions in place of any permissions specified in the shared translation structures.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of co-pending U.S. application Ser.No. 16/728,928, filed on Dec. 27, 2019, all of which is hereinincorporated by reference.

BACKGROUND Field of the Invention

The embodiments of the invention relate generally to the field ofcomputer processors. More particularly, the embodiments relate to amemory management apparatus and method for compartmentalization usinglinear address metadata.

DESCRIPTION OF THE RELATED ART

In current processors, a virtual address is translated to a physicaladdress using a set of page tables managed by the processor's addresstranslation circuitry. A pointer stored in one or more control registers(e.g., a CR3 register) points to a base translation table and differentportions of the virtual address are used to identify different levels oftranslation tables to generate the physical address.

Software is becoming increasingly complex, with different components,functionalities, and security boundaries. In particular, the model ofwell-defined boundaries is often implemented for security, to isolatedifferent components of an application. From a hardware perspective,however, an entire application is in one process address space.Consequently, there is no memory isolation between components and asecurity bug (such as an exploitable memory corruption) in one componentcan lead to the entire application being compromised. Software vendorshave attempted to mitigate this issue by placing these components indifferent processes. While process isolation provides a natural defense,it results in added memory overhead, performance impacts in terms oflatency and responsiveness, and potentially increased power usage.

BRIEF DESCRIPTION OF THE DRAWINGS

A better understanding of the present invention can be obtained from thefollowing detailed description in conjunction with the followingdrawings, in which:

FIGS. 1A and 1B are block diagrams illustrating a generic vectorfriendly instruction format and instruction templates thereof accordingto embodiments of the invention;

FIGS. 2A-C are block diagrams illustrating an exemplary VEX instructionformat according to embodiments of the invention;

FIG. 3 is a block diagram of a register architecture according to oneembodiment of the invention; and

FIG. 4A is a block diagram illustrating both an exemplary in-orderfetch, decode, retire pipeline and an exemplary register renaming,out-of-order issue/execution pipeline according to embodiments of theinvention;

FIG. 4B is a block diagram illustrating both an exemplary embodiment ofan in-order fetch, decode, retire core and an exemplary registerrenaming, out-of-order issue/execution architecture core to be includedin a processor according to embodiments of the invention;

FIG. 5A is a block diagram of a single processor core, along with itsconnection to an on-die interconnect network;

FIG. 5B illustrates an expanded view of part of the processor core inFIG. 5A according to embodiments of the invention;

FIG. 6 is a block diagram of a single core processor and a multicoreprocessor with integrated memory controller and graphics according toembodiments of the invention;

FIG. 7 illustrates a block diagram of a system in accordance with oneembodiment of the present invention;

FIG. 8 illustrates a block diagram of a second system in accordance withan embodiment of the present invention;

FIG. 9 illustrates a block diagram of a third system in accordance withan embodiment of the present invention;

FIG. 10 illustrates a block diagram of a system on a chip (SoC) inaccordance with an embodiment of the present invention;

FIG. 11 illustrates a block diagram contrasting the use of a softwareinstruction converter to convert binary instructions in a sourceinstruction set to binary instructions in a target instruction setaccording to embodiments of the invention;

FIGS. 12-13 illustrate two different types of page table lookups;

FIG. 14 illustrates one embodiment of a linear address tag table (LATT)entry;

FIGS. 15A-B illustrate different processor architectures on whichembodiments of the invention may be implemented;

FIGS. 16A-B illustrate a lookup in a linear address tag table (LATT) inparallel with a page table lookup;

FIG. 17 illustrates one embodiment of an architecture for evaluatingpage table entries using tags;

FIG. 18 illustrates one embodiment of a process for performing pagewalks with access checks;

FIGS. 19A-C illustrate three control registers used in one embodiment;

FIG. 20 illustrates a specific example of compartmentalization using theembodiments of the invention;

FIG. 21 illustrates a specific example using a cryptographic libraryprovided access to an application buffer;

FIG. 22 illustrates an example comprising a plurality of hierarchicallyarranged sandboxes;

FIG. 23 illustrates one embodiment of a PCID index table;

FIG. 24 illustrates a method in accordance with one embodiment of theinvention;

FIG. 25 illustrates one embodiment including first and secondtranslation structures;

FIG. 26 illustrates one embodiment in which permissions from the firsttranslation structure overrides permissions in a second translationstructure; and

FIG. 27A-B illustrates embodiments in which permissions are efficientlymapped at a higher level of granularity.

DETAILED DESCRIPTION

In the following description, for the purposes of explanation, numerousspecific details are set forth in order to provide a thoroughunderstanding of the embodiments of the invention described below. Itwill be apparent, however, to one skilled in the art that theembodiments of the invention may be practiced without some of thesespecific details. In other instances, well-known structures and devicesare shown in block diagram form to avoid obscuring the underlyingprinciples of the embodiments of the invention.

Exemplary Processor Architectures, Instruction Formats, and Data Types

An instruction set includes one or more instruction formats. A giveninstruction format defines various fields (number of bits, location ofbits) to specify, among other things, the operation to be performed(opcode) and the operand(s) on which that operation is to be performed.Some instruction formats are further broken down though the definitionof instruction templates (or subformats). For example, the instructiontemplates of a given instruction format may be defined to have differentsubsets of the instruction format's fields (the included fields aretypically in the same order, but at least some have different bitpositions because there are less fields included) and/or defined to havea given field interpreted differently. Thus, each instruction of an ISAis expressed using a given instruction format (and, if defined, in agiven one of the instruction templates of that instruction format) andincludes fields for specifying the operation and the operands. Forexample, an exemplary ADD instruction has a specific opcode and aninstruction format that includes an opcode field to specify that opcodeand operand fields to select operands (source1/destination and source2);and an occurrence of this ADD instruction in an instruction stream willhave specific contents in the operand fields that select specificoperands.

Embodiments of the instruction(s) described herein may be embodied indifferent formats. Additionally, exemplary systems, architectures, andpipelines are detailed below. Embodiments of the instruction(s) may beexecuted on such systems, architectures, and pipelines, but are notlimited to those detailed.

Generic Vector Friendly Instruction Format

A vector friendly instruction format is an instruction format that issuited for vector instructions (e.g., there are certain fields specificto vector operations). While embodiments are described in which bothvector and scalar operations are supported through the vector friendlyinstruction format, alternative embodiments use only vector operationsthe vector friendly instruction format.

FIGS. 1A-1B are block diagrams illustrating a generic vector friendlyinstruction format and instruction templates thereof according toembodiments of the invention. FIG. 1A is a block diagram illustrating ageneric vector friendly instruction format and class A instructiontemplates thereof according to embodiments of the invention; while FIG.1B is a block diagram illustrating the generic vector friendlyinstruction format and class B instruction templates thereof accordingto embodiments of the invention. Specifically, a generic vector friendlyinstruction format 100 for which are defined class A and class Binstruction templates, both of which include no memory access 105instruction templates and memory access 120 instruction templates. Theterm generic in the context of the vector friendly instruction formatrefers to the instruction format not being tied to any specificinstruction set.

While embodiments of the invention will be described in which the vectorfriendly instruction format supports the following: a 64 byte vectoroperand length (or size) with 32 bit (4 byte) or 64 bit (8 byte) dataelement widths (or sizes) (and thus, a 64 byte vector consists of either16 doubleword-size elements or alternatively, 8 quadword-size elements);a 64 byte vector operand length (or size) with 16 bit (2 byte) or 8 bit(1 byte) data element widths (or sizes); a 32 byte vector operand length(or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit (2 byte), or 8bit (1 byte) data element widths (or sizes); and a 16 byte vectoroperand length (or size) with 32 bit (4 byte), 64 bit (8 byte), 16 bit(2 byte), or 8 bit (1 byte) data element widths (or sizes); alternativeembodiments may support more, less and/or different vector operand sizes(e.g., 256 byte vector operands) with more, less, or different dataelement widths (e.g., 128 bit (16 byte) data element widths).

The class A instruction templates in FIG. 1A include: 1) within the nomemory access 105 instruction templates there is shown a no memoryaccess, full round control type operation 110 instruction template and ano memory access, data transform type operation 115 instructiontemplate; and 2) within the memory access 120 instruction templatesthere is shown a memory access, temporal 125 instruction template and amemory access, non-temporal 130 instruction template. The class Binstruction templates in FIG. 1B include: 1) within the no memory access105 instruction templates there is shown a no memory access, write maskcontrol, partial round control type operation 112 instruction templateand a no memory access, write mask control, vsize type operation 117instruction template; and 2) within the memory access 120 instructiontemplates there is shown a memory access, write mask control 127instruction template.

The generic vector friendly instruction format 100 includes thefollowing fields listed below in the order illustrated in FIGS. 1A-1B.

Format field 140—a specific value (an instruction format identifiervalue) in this field uniquely identifies the vector friendly instructionformat, and thus occurrences of instructions in the vector friendlyinstruction format in instruction streams. As such, this field isoptional in the sense that it is not needed for an instruction set thathas only the generic vector friendly instruction format.

Base operation field 142—its content distinguishes different baseoperations.

Register index field 144—its content, directly or through addressgeneration, specifies the locations of the source and destinationoperands, be they in registers or in memory. These include a sufficientnumber of bits to select N registers from a P×Q (e.g. 32×512, 16×128,32×1024, 64×1024) register file. While in one embodiment N may be up tothree sources and one destination register, alternative embodiments maysupport more or less sources and destination registers (e.g., maysupport up to two sources where one of these sources also acts as thedestination, may support up to three sources where one of these sourcesalso acts as the destination, may support up to two sources and onedestination).

Modifier field 146—its content distinguishes occurrences of instructionsin the generic vector instruction format that specify memory access fromthose that do not; that is, between no memory access 105 instructiontemplates and memory access 120 instruction templates. Memory accessoperations read and/or write to the memory hierarchy (in some casesspecifying the source and/or destination addresses using values inregisters), while non-memory access operations do not (e.g., the sourceand destinations are registers). While in one embodiment this field alsoselects between three different ways to perform memory addresscalculations, alternative embodiments may support more, less, ordifferent ways to perform memory address calculations.

Augmentation operation field 150—its content distinguishes which one ofa variety of different operations to be performed in addition to thebase operation. This field is context specific. In one embodiment of theinvention, this field is divided into a class field 168, an alpha field152, and a beta field 154. The augmentation operation field 150 allowscommon groups of operations to be performed in a single instructionrather than 2, 3, or 4 instructions.

Scale field 160—its content allows for the scaling of the index field'scontent for memory address generation (e.g., for address generation thatuses 2^(scale)*index+base).

Displacement Field 162A—its content is used as part of memory addressgeneration (e.g., for address generation that uses2^(scale)*index+base+displacement).

Displacement Factor Field 1628 (note that the juxtaposition ofdisplacement field 162A directly over displacement factor field 1628indicates one or the other is used)—its content is used as part ofaddress generation; it specifies a displacement factor that is to bescaled by the size of a memory access (N)—where N is the number of bytesin the memory access (e.g., for address generation that uses2^(scale)*index+base+scaled displacement). Redundant low-order bits areignored and hence, the displacement factor field's content is multipliedby the memory operands total size (N) in order to generate the finaldisplacement to be used in calculating an effective address. The valueof N is determined by the processor hardware at runtime based on thefull opcode field 174 (described later herein) and the data manipulationfield 154C. The displacement field 162A and the displacement factorfield 162B are optional in the sense that they are not used for the nomemory access 105 instruction templates and/or different embodiments mayimplement only one or none of the two.

Data element width field 164—its content distinguishes which one of anumber of data element widths is to be used (in some embodiments for allinstructions; in other embodiments for only some of the instructions).This field is optional in the sense that it is not needed if only onedata element width is supported and/or data element widths are supportedusing some aspect of the opcodes.

Write mask field 170—its content controls, on a per data elementposition basis, whether that data element position in the destinationvector operand reflects the result of the base operation andaugmentation operation. Class A instruction templates supportmerging-writemasking, while class B instruction templates support bothmerging- and zeroing-writemasking. When merging, vector masks allow anyset of elements in the destination to be protected from updates duringthe execution of any operation (specified by the base operation and theaugmentation operation); in other one embodiment, preserving the oldvalue of each element of the destination where the corresponding maskbit has a 0. In contrast, when zeroing vector masks allow any set ofelements in the destination to be zeroed during the execution of anyoperation (specified by the base operation and the augmentationoperation); in one embodiment, an element of the destination is set to 0when the corresponding mask bit has a 0 value. A subset of thisfunctionality is the ability to control the vector length of theoperation being performed (that is, the span of elements being modified,from the first to the last one); however, it is not necessary that theelements that are modified be consecutive. Thus, the write mask field170 allows for partial vector operations, including loads, stores,arithmetic, logical, etc. While embodiments of the invention aredescribed in which the write mask field's 170 content selects one of anumber of write mask registers that contains the write mask to be used(and thus the write mask field's 170 content indirectly identifies thatmasking to be performed), alternative embodiments instead or additionalallow the mask write field's 170 content to directly specify the maskingto be performed.

Immediate field 172—its content allows for the specification of animmediate. This field is optional in the sense that is it not present inan implementation of the generic vector friendly format that does notsupport immediate and it is not present in instructions that do not usean immediate.

Class field 168—its content distinguishes between different classes ofinstructions. With reference to FIGS. 1A-B, the contents of this fieldselect between class A and class B instructions. In FIGS. 1A-B, roundedcorner squares are used to indicate a specific value is present in afield (e.g., class A 168A and class B 168B for the class field 168respectively in FIGS. 1A-B).

Instruction Templates of Class A

In the case of the non-memory access 105 instruction templates of classA, the alpha field 152 is interpreted as an RS field 152A, whose contentdistinguishes which one of the different augmentation operation typesare to be performed (e.g., round 152A.1 and data transform 152A.2 arerespectively specified for the no memory access, round type operation110 and the no memory access, data transform type operation 115instruction templates), while the beta field 154 distinguishes which ofthe operations of the specified type is to be performed. In the nomemory access 105 instruction templates, the scale field 160, thedisplacement field 162A, and the displacement scale filed 162B are notpresent.

No-Memory Access Instruction Templates—Full Round Control Type Operation

In the no memory access full round control type operation 110instruction template, the beta field 154 is interpreted as a roundcontrol field 154A, whose content(s) provide static rounding. While inthe described embodiments of the invention the round control field 154Aincludes a suppress all floating point exceptions (SAE) field 156 and around operation control field 158, alternative embodiments may supportmay encode both these concepts into the same field or only have one orthe other of these concepts/fields (e.g., may have only the roundoperation control field 158).

SAE field 156—its content distinguishes whether or not to disable theexception event reporting; when the SAE field's 156 content indicatessuppression is enabled, a given instruction does not report any kind offloating-point exception flag and does not raise any floating pointexception handler.

Round operation control field 158—its content distinguishes which one ofa group of rounding operations to perform (e.g., Round-up, Round-down,Round-towards-zero and Round-to-nearest). Thus, the round operationcontrol field 158 allows for the changing of the rounding mode on a perinstruction basis. In one embodiment of the invention where a processorincludes a control register for specifying rounding modes, the roundoperation control field's 150 content overrides that register value.

No Memory Access Instruction Templates—Data Transform Type Operation

In the no memory access data transform type operation 115 instructiontemplate, the beta field 154 is interpreted as a data transform field154B, whose content distinguishes which one of a number of datatransforms is to be performed (e.g., no data transform, swizzle,broadcast).

In the case of a memory access 120 instruction template of class A, thealpha field 152 is interpreted as an eviction hint field 152B, whosecontent distinguishes which one of the eviction hints is to be used (inFIG. 1A, temporal 152B.1 and non-temporal 152B.2 are respectivelyspecified for the memory access, temporal 125 instruction template andthe memory access, non-temporal 130 instruction template), while thebeta field 154 is interpreted as a data manipulation field 154C, whosecontent distinguishes which one of a number of data manipulationoperations (also known as primitives) is to be performed (e.g., nomanipulation; broadcast; up conversion of a source; and down conversionof a destination). The memory access 120 instruction templates includethe scale field 160, and optionally the displacement field 162A or thedisplacement scale field 162B.

Vector memory instructions perform vector loads from and vector storesto memory, with conversion support. As with regular vector instructions,vector memory instructions transfer data from/to memory in a dataelement-wise fashion, with the elements that are actually transferred isdictated by the contents of the vector mask that is selected as thewrite mask.

Memory Access Instruction Templates—Temporal

Temporal data is data likely to be reused soon enough to benefit fromcaching. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Memory Access Instruction Templates—Non-Temporal

Non-temporal data is data unlikely to be reused soon enough to benefitfrom caching in the 1st-level cache and should be given priority foreviction. This is, however, a hint, and different processors mayimplement it in different ways, including ignoring the hint entirely.

Instruction Templates of Class B

In the case of the instruction templates of class B, the alpha field 152is interpreted as a write mask control (Z) field 152C, whose contentdistinguishes whether the write masking controlled by the write maskfield 170 should be a merging or a zeroing.

In the case of the non-memory access 105 instruction templates of classB, part of the beta field 154 is interpreted as an RL field 157A, whosecontent distinguishes which one of the different augmentation operationtypes are to be performed (e.g., round 157A.1 and vector length (VSIZE)157A.2 are respectively specified for the no memory access, write maskcontrol, partial round control type operation 112 instruction templateand the no memory access, write mask control, VSIZE type operation 117instruction template), while the rest of the beta field 154distinguishes which of the operations of the specified type is to beperformed. In the no memory access 105 instruction templates, the scalefield 160, the displacement field 162A, and the displacement scale filed162B are not present.

In the no memory access, write mask control, partial round control typeoperation 110 instruction template, the rest of the beta field 154 isinterpreted as a round operation field 159A and exception eventreporting is disabled (a given instruction does not report any kind offloating-point exception flag and does not raise any floating pointexception handler).

Round operation control field 159A—just as round operation control field158, its content distinguishes which one of a group of roundingoperations to perform (e.g., Round-up, Round-down, Round-towards-zeroand Round-to-nearest). Thus, the round operation control field 159Aallows for the changing of the rounding mode on a per instruction basis.In one embodiment of the invention where a processor includes a controlregister for specifying rounding modes, the round operation controlfield's 150 content overrides that register value.

In the no memory access, write mask control, VSIZE type operation 117instruction template, the rest of the beta field 154 is interpreted as avector length field 159B, whose content distinguishes which one of anumber of data vector lengths is to be performed on (e.g., 128, 256, or512 byte).

In the case of a memory access 120 instruction template of class B, partof the beta field 154 is interpreted as a broadcast field 157B, whosecontent distinguishes whether or not the broadcast type datamanipulation operation is to be performed, while the rest of the betafield 154 is interpreted the vector length field 159B. The memory access120 instruction templates include the scale field 160, and optionallythe displacement field 162A or the displacement scale field 162B.

With regard to the generic vector friendly instruction format 100, afull opcode field 174 is shown including the format field 140, the baseoperation field 142, and the data element width field 164. While oneembodiment is shown where the full opcode field 174 includes all ofthese fields, the full opcode field 174 includes less than all of thesefields in embodiments that do not support all of them. The full opcodefield 174 provides the operation code (opcode).

The augmentation operation field 150, the data element width field 164,and the write mask field 170 allow these features to be specified on aper instruction basis in the generic vector friendly instruction format.

The combination of write mask field and data element width field createtyped instructions in that they allow the mask to be applied based ondifferent data element widths.

The various instruction templates found within class A and class B arebeneficial in different situations. In some embodiments of theinvention, different processors or different cores within a processormay support only class A, only class B, or both classes. For instance, ahigh performance general purpose out-of-order core intended forgeneral-purpose computing may support only class B, a core intendedprimarily for graphics and/or scientific (throughput) computing maysupport only class A, and a core intended for both may support both (ofcourse, a core that has some mix of templates and instructions from bothclasses but not all templates and instructions from both classes iswithin the purview of the invention). Also, a single processor mayinclude multiple cores, all of which support the same class or in whichdifferent cores support different class. For instance, in a processorwith separate graphics and general purpose cores, one of the graphicscores intended primarily for graphics and/or scientific computing maysupport only class A, while one or more of the general purpose cores maybe high performance general purpose cores with out of order executionand register renaming intended for general-purpose computing thatsupport only class B. Another processor that does not have a separategraphics core, may include one more general purpose in-order orout-of-order cores that support both class A and class B. Of course,features from one class may also be implement in the other class indifferent embodiments of the invention. Programs written in a high levellanguage would be put (e.g., just in time compiled or staticallycompiled) into an variety of different executable forms, including: 1) aform having only instructions of the class(es) supported by the targetprocessor for execution; or 2) a form having alternative routineswritten using different combinations of the instructions of all classesand having control flow code that selects the routines to execute basedon the instructions supported by the processor which is currentlyexecuting the code.

VEX Instruction Format

VEX encoding allows instructions to have more than two operands, andallows SIMD vector registers to be longer than 28 bits. The use of a VEXprefix provides for three-operand (or more) syntax. For example,previous two-operand instructions performed operations such as A=A+B,which overwrites a source operand. The use of a VEX prefix enablesoperands to perform nondestructive operations such as A=B+C.

FIG. 2A illustrates an exemplary AVX instruction format including a VEXprefix 202, real opcode field 230, Mod R/M byte 240, SIB byte 250,displacement field 262, and IMM8 272. FIG. 2B illustrates which fieldsfrom FIG. 2A make up a full opcode field 274 and a base operation field241. FIG. 2C illustrates which fields from FIG. 2A make up a registerindex field 244.

VEX Prefix (Bytes 0-2) 202 is encoded in a three-byte form. The firstbyte is the Format Field 290 (VEX Byte 0, bits [7:0]), which contains anexplicit C4 byte value (the unique value used for distinguishing the C4instruction format). The second-third bytes (VEX Bytes 1-2) include anumber of bit fields providing specific capability. Specifically, REXfield 205 (VEX Byte 1, bits [7-5]) consists of a VEX.R bit field (VEXByte 1, bit [7]-R), VEX.X bit field (VEX byte 1, bit [6]-X), and VEX.Bbit field (VEX byte 1, bit[5]-B). Other fields of the instructionsencode the lower three bits of the register indexes as is known in theart (rrr, xxx, and bbb), so that Rrrr, Xxxx, and Bbbb may be formed byadding VEX.R, VEX.X, and VEX.B. Opcode map field 215 (VEX byte 1, bits[4:0]-mmmmm) includes content to encode an implied leading opcode byte.W Field 264 (VEX byte 2, bit [7]-W)—is represented by the notationVEX.W, and provides different functions depending on the instruction.The role of VEX.vvvv 220 (VEX Byte 2, bits [6:3]-vvvv) may include thefollowing: 1) VEX.vvvv encodes the first source register operand,specified in inverted (1s complement) form and is valid for instructionswith 2 or more source operands; 2) VEX.vvvv encodes the destinationregister operand, specified in 1s complement form for certain vectorshifts; or 3) VEX.vvvv does not encode any operand, the field isreserved and should contain 1111b. If VEX.L 268 Size field (VEX byte 2,bit [2]-L)=0, it indicates 28 bit vector; if VEX.L=1, it indicates 256bit vector. Prefix encoding field 225 (VEX byte 2, bits [1:0]-pp)provides additional bits for the base operation field 241.

Real Opcode Field 230 (Byte 3) is also known as the opcode byte. Part ofthe opcode is specified in this field.

MOD R/M Field 240 (Byte 4) includes MOD field 242 (bits [7-6]), Regfield 244 (bits [5-3]), and R/M field 246 (bits [2-0]). The role of Regfield 244 may include the following: encoding either the destinationregister operand or a source register operand (the rrr of Rrrr), or betreated as an opcode extension and not used to encode any instructionoperand. The role of R/M field 246 may include the following: encodingthe instruction operand that references a memory address, or encodingeither the destination register operand or a source register operand.

Scale, Index, Base (SIB)—The content of Scale field 250 (Byte 5)includes SS 252 (bits [7-6]), which is used for memory addressgeneration. The contents of SIB.xxx 254 (bits [5-3]) and SIB.bbb 256(bits [2-0]) have been previously referred to with regard to theregister indexes Xxxx and Bbbb.

The Displacement Field 262 and the immediate field (IMM8) 272 containdata.

Exemplary Register Architecture

FIG. 3 is a block diagram of a register architecture 300 according toone embodiment of the invention. In the embodiment illustrated, thereare 32 vector registers 310 that are 512 bits wide; these registers arereferenced as zmm0 through zmm31. The lower order 256 bits of the lower6 zmm registers are overlaid on registers ymm0-15. The lower order 128bits of the lower 6 zmm registers (the lower order 128 bits of the ymmregisters) are overlaid on registers xmm0-15.

General-purpose registers 325—in the embodiment illustrated, there aresixteen 64-bit general-purpose registers that are used along with theexisting x86 addressing modes to address memory operands. Theseregisters are referenced by the names RAX, RBX, RCX, RDX, RBP, RSI, RDI,RSP, and R8 through R15.

Scalar floating point stack register file (x87 stack) 345, on which isaliased the MMX packed integer flat register file 350—in the embodimentillustrated, the x87 stack is an eight-element stack used to performscalar floating-point operations on 32/64/80-bit floating point datausing the x87 instruction set extension; while the MMX registers areused to perform operations on 64-bit packed integer data, as well as tohold operands for some operations performed between the MMX and XMMregisters.

Alternative embodiments of the invention may use wider or narrowerregisters. Additionally, alternative embodiments of the invention mayuse more, less, or different register files and registers.

Exemplary Core Architectures, Processors, and Computer Architectures

Processor cores may be implemented in different ways, for differentpurposes, and in different processors. For instance, implementations ofsuch cores may include: 1) a general purpose in-order core intended forgeneral-purpose computing; 2) a high performance general purposeout-of-order core intended for general-purpose computing; 3) a specialpurpose core intended primarily for graphics and/or scientific(throughput) computing. Implementations of different processors mayinclude: 1) a CPU including one or more general purpose in-order coresintended for general-purpose computing and/or one or more generalpurpose out-of-order cores intended for general-purpose computing; and2) a coprocessor including one or more special purpose cores intendedprimarily for graphics and/or scientific (throughput). Such differentprocessors lead to different computer system architectures, which mayinclude: 1) the coprocessor on a separate chip from the CPU; 2) thecoprocessor on a separate die in the same package as a CPU; 3) thecoprocessor on the same die as a CPU (in which case, such a coprocessoris sometimes referred to as special purpose logic, such as integratedgraphics and/or scientific (throughput) logic, or as special purposecores); and 4) a system on a chip that may include on the same die thedescribed CPU (sometimes referred to as the application core(s) orapplication processor(s)), the above described coprocessor, andadditional functionality. Exemplary core architectures are describednext, followed by descriptions of exemplary processors and computerarchitectures. Detailed herein are circuits (units) that compriseexemplary cores, processors, etc.

Exemplary Core Architectures

FIG. 4A is a block diagram illustrating both an exemplary in-orderpipeline and an exemplary register renaming, out-of-orderissue/execution pipeline according to embodiments of the invention. FIG.4B is a block diagram illustrating both an exemplary embodiment of anin-order architecture core and an exemplary register renaming,out-of-order issue/execution architecture core to be included in aprocessor according to embodiments of the invention. The solid linedboxes in FIGS. 4A-B illustrate the in-order pipeline and in-order core,while the optional addition of the dashed lined boxes illustrates theregister renaming, out-of-order issue/execution pipeline and core. Giventhat the in-order aspect is a subset of the out-of-order aspect, theout-of-order aspect will be described.

In FIG. 4A, a processor pipeline 400 includes a fetch stage 402, alength decode stage 404, a decode stage 406, an allocation stage 408, arenaming stage 410, a scheduling (also known as a dispatch or issue)stage 412, a register read/memory read stage 414, an execute stage 416,a write back/memory write stage 418, an exception handling stage 422,and a commit stage 424.

FIG. 4B shows processor core 490 including a front end unit 430 coupledto an execution engine unit 450, and both are coupled to a memory unit470. The core 490 may be a reduced instruction set computing (RISC)core, a complex instruction set computing (CISC) core, a very longinstruction word (VLIW) core, or a hybrid or alternative core type. Asyet another option, the core 490 may be a special-purpose core, such as,for example, a network or communication core, compression engine,coprocessor core, general purpose computing graphics processing unit(GPGPU) core, graphics core, or the like.

The front end unit 430 includes a branch prediction unit 432 coupled toan instruction cache unit 434, which is coupled to an instructiontranslation lookaside buffer (TLB) 436, which is coupled to aninstruction fetch unit 438, which is coupled to a decode unit 440. Thedecode unit 440 (or decoder) may decode instructions, and generate as anoutput one or more micro-operations, micro-code entry points,microinstructions, other instructions, or other control signals, whichare decoded from, or which otherwise reflect, or are derived from, theoriginal instructions. The decode unit 440 may be implemented usingvarious different mechanisms. Examples of suitable mechanisms include,but are not limited to, look-up tables, hardware implementations,programmable logic arrays (PLAs), microcode read only memories (ROMs),etc. In one embodiment, the core 490 includes a microcode ROM or othermedium that stores microcode for certain macroinstructions (e.g., indecode unit 440 or otherwise within the front end unit 430). The decodeunit 440 is coupled to a rename/allocator unit 452 in the executionengine unit 450.

The execution engine unit 450 includes the rename/allocator unit 452coupled to a retirement unit 454 and a set of one or more schedulerunit(s) 456. The scheduler unit(s) 456 represents any number ofdifferent schedulers, including reservations stations, centralinstruction window, etc. The scheduler unit(s) 456 is coupled to thephysical register file(s) unit(s) 458. Each of the physical registerfile(s) units 458 represents one or more physical register files,different ones of which store one or more different data types, such asscalar integer, scalar floating point, packed integer, packed floatingpoint, vector integer, vector floating point, status (e.g., aninstruction pointer that is the address of the next instruction to beexecuted), etc. In one embodiment, the physical register file(s) unit458 comprises a vector registers unit and a scalar registers unit. Theseregister units may provide architectural vector registers, vector maskregisters, and general purpose registers. The physical register file(s)unit(s) 458 is overlapped by the retirement unit 454 to illustratevarious ways in which register renaming and out-of-order execution maybe implemented (e.g., using a reorder buffer(s) and a retirementregister file(s); using a future file(s), a history buffer(s), and aretirement register file(s); using a register maps and a pool ofregisters; etc.). The retirement unit 454 and the physical registerfile(s) unit(s) 458 are coupled to the execution cluster(s) 460. Theexecution cluster(s) 460 includes a set of one or more execution units462 and a set of one or more memory access units 464. The executionunits 462 may perform various operations (e.g., shifts, addition,subtraction, multiplication) and on various types of data (e.g., scalarfloating point, packed integer, packed floating point, vector integer,vector floating point). While some embodiments may include a number ofexecution units dedicated to specific functions or sets of functions,other embodiments may include only one execution unit or multipleexecution units that all perform all functions. The scheduler unit(s)456, physical register file(s) unit(s) 458, and execution cluster(s) 460are shown as being possibly plural because certain embodiments createseparate pipelines for certain types of data/operations (e.g., a scalarinteger pipeline, a scalar floating point/packed integer/packed floatingpoint/vector integer/vector floating point pipeline, and/or a memoryaccess pipeline that each have their own scheduler unit, physicalregister file(s) unit, and/or execution cluster—and in the case of aseparate memory access pipeline, certain embodiments are implemented inwhich only the execution cluster of this pipeline has the memory accessunit(s) 464). It should also be understood that where separate pipelinesare used, one or more of these pipelines may be out-of-orderissue/execution and the rest in-order.

The set of memory access units 464 is coupled to the memory unit 470,which includes a data TLB unit 472 coupled to a data cache unit 474coupled to a level 2 (L2) cache unit 476. In one exemplary embodiment,the memory access units 464 may include a load unit, a store addressunit, and a store data unit, each of which is coupled to the data TLBunit 472 in the memory unit 470. The instruction cache unit 434 isfurther coupled to a level 2 (L2) cache unit 476 in the memory unit 470.The L2 cache unit 476 is coupled to one or more other levels of cacheand eventually to a main memory.

By way of example, the exemplary register renaming, out-of-orderissue/execution core architecture may implement the pipeline 400 asfollows: 1) the instruction fetch 438 performs the fetch and lengthdecoding stages 402 and 404; 2) the decode unit 440 performs the decodestage 406; 3) the rename/allocator unit 452 performs the allocationstage 408 and renaming stage 410; 4) the scheduler unit(s) 456 performsthe schedule stage 412; 5) the physical register file(s) unit(s) 458 andthe memory unit 470 perform the register read/memory read stage 414; theexecution cluster 460 perform the execute stage 416; 6) the memory unit470 and the physical register file(s) unit(s) 458 perform the writeback/memory write stage 418; 7) various units may be involved in theexception handling stage 422; and 8) the retirement unit 454 and thephysical register file(s) unit(s) 458 perform the commit stage 424.

The core 490 may support one or more instructions sets (e.g., the x86instruction set (with some extensions that have been added with newerversions); the MIPS instruction set of MIPS Technologies of Sunnyvale,Calif.; the ARM instruction set (with optional additional extensionssuch as NEON) of ARM Holdings of Sunnyvale, Calif.), including theinstruction(s) described herein. In one embodiment, the core 490includes logic to support a packed data instruction set extension (e.g.,AVX1, AVX2), thereby allowing the operations used by many multimediaapplications to be performed using packed data.

It should be understood that the core may support multithreading(executing two or more parallel sets of operations or threads), and maydo so in a variety of ways including time sliced multithreading,simultaneous multithreading (where a single physical core provides alogical core for each of the threads that physical core issimultaneously multithreading), or a combination thereof (e.g., timesliced fetching and decoding and simultaneous multithreading thereaftersuch as in the Intel® Hyperthreading technology).

While register renaming is described in the context of out-of-orderexecution, it should be understood that register renaming may be used inan in-order architecture. While the illustrated embodiment of theprocessor also includes separate instruction and data cache units434/474 and a shared L2 cache unit 476, alternative embodiments may havea single internal cache for both instructions and data, such as, forexample, a Level 1 (L1) internal cache, or multiple levels of internalcache. In some embodiments, the system may include a combination of aninternal cache and an external cache that is external to the core and/orthe processor. Alternatively, all of the cache may be external to thecore and/or the processor.

Specific Exemplary In-Order Core Architecture

FIGS. 5A-B illustrate a block diagram of a more specific exemplaryin-order core architecture, which core would be one of several logicblocks (including other cores of the same type and/or different types)in a chip. The logic blocks communicate through a high-bandwidthinterconnect network (e.g., a ring network) with some fixed functionlogic, memory I/O interfaces, and other necessary I/O logic, dependingon the application.

FIG. 5A is a block diagram of a single processor core, along with itsconnection to the on-die interconnect network 502 and with its localsubset of the Level 2 (L2) cache 504, according to embodiments of theinvention. In one embodiment, an instruction decoder 500 supports thex86 instruction set with a packed data instruction set extension. An L1cache 506 allows low-latency accesses to cache memory into the scalarand vector units. While in one embodiment (to simplify the design), ascalar unit 508 and a vector unit 510 use separate register sets(respectively, scalar registers 512 and vector registers 514) and datatransferred between them is written to memory and then read back in froma level 1 (L1) cache 506, alternative embodiments of the invention mayuse a different approach (e.g., use a single register set or include acommunication path that allow data to be transferred between the tworegister files without being written and read back).

The local subset of the L2 cache 504 is part of a global L2 cache thatis divided into separate local subsets, one per processor core. Eachprocessor core has a direct access path to its own local subset of theL2 cache 504. Data read by a processor core is stored in its L2 cachesubset 504 and can be accessed quickly, in parallel with other processorcores accessing their own local L2 cache subsets. Data written by aprocessor core is stored in its own L2 cache subset 504 and is flushedfrom other subsets, if necessary. The ring network ensures coherency forshared data. The ring network is bi-directional to allow agents such asprocessor cores, L2 caches and other logic blocks to communicate witheach other within the chip. Each ring data-path is 1024-bits wide perdirection in some embodiments.

FIG. 5B is an expanded view of part of the processor core in FIG. 5Aaccording to embodiments of the invention. FIG. 5B includes an L1 datacache 506A part of the L1 cache 504, as well as more detail regardingthe vector unit 510 and the vector registers 514. Specifically, thevector unit 510 is a 6-wide vector processing unit (VPU) (see the16-wide ALU 528), which executes one or more of integer,single-precision float, and double-precision float instructions. The VPUsupports swizzling the register inputs with swizzle unit 520, numericconversion with numeric convert units 522A-B, and replication withreplication unit 524 on the memory input.

Processor with Integrated Memory Controller and Graphics

FIG. 6 is a block diagram of a processor 600 that may have more than onecore, may have an integrated memory controller, and may have integratedgraphics according to embodiments of the invention. The solid linedboxes in FIG. 6 illustrate a processor 600 with a single core 602A, asystem agent 610, a set of one or more bus controller units 616, whilethe optional addition of the dashed lined boxes illustrates analternative processor 600 with multiple cores 602A-N, a set of one ormore integrated memory controller unit(s) 614 in the system agent unit610, and special purpose logic 608.

Thus, different implementations of the processor 600 may include: 1) aCPU with the special purpose logic 608 being integrated graphics and/orscientific (throughput) logic (which may include one or more cores), andthe cores 602A-N being one or more general purpose cores (e.g., generalpurpose in-order cores, general purpose out-of-order cores, acombination of the two); 2) a coprocessor with the cores 602A-N being alarge number of special purpose cores intended primarily for graphicsand/or scientific (throughput); and 3) a coprocessor with the cores602A-N being a large number of general purpose in-order cores. Thus, theprocessor 600 may be a general-purpose processor, coprocessor orspecial-purpose processor, such as, for example, a network orcommunication processor, compression engine, graphics processor, GPGPU(general purpose graphics processing unit), a high-throughput manyintegrated core (MIC) coprocessor (including 30 or more cores), embeddedprocessor, or the like. The processor may be implemented on one or morechips. The processor 600 may be a part of and/or may be implemented onone or more substrates using any of a number of process technologies,such as, for example, BiCMOS, CMOS, or NMOS.

The memory hierarchy includes one or more levels of cache within thecores 604A-N, a set or one or more shared cache units 606, and externalmemory (not shown) coupled to the set of integrated memory controllerunits 614. The set of shared cache units 606 may include one or moremid-level caches, such as level 2 (L2), level 3 (L3), level 4 (L4), orother levels of cache, a last level cache (LLC), and/or combinationsthereof. While in one embodiment a ring based interconnect unit 612interconnects the integrated graphics logic 608, the set of shared cacheunits 606, and the system agent unit 610/integrated memory controllerunit(s) 614, alternative embodiments may use any number of well-knowntechniques for interconnecting such units. In one embodiment, coherencyis maintained between one or more cache units 606 and cores 602-A-N.

In some embodiments, one or more of the cores 602A-N are capable ofmulti-threading. The system agent 610 includes those componentscoordinating and operating cores 602A-N. The system agent unit 610 mayinclude for example a power control unit (PCU) and a display unit. ThePCU may be or include logic and components needed for regulating thepower state of the cores 602A-N and the integrated graphics logic 608.The display unit is for driving one or more externally connecteddisplays.

The cores 602A-N may be homogenous or heterogeneous in terms ofarchitecture instruction set; that is, two or more of the cores 602A-Nmay be capable of execution the same instruction set, while others maybe capable of executing only a subset of that instruction set or adifferent instruction set.

Exemplary Computer Architectures

FIGS. 7-10 are block diagrams of exemplary computer architectures. Othersystem designs and configurations known in the arts for laptops,desktops, handheld PCs, personal digital assistants, engineeringworkstations, servers, network devices, network hubs, switches, embeddedprocessors, digital signal processors (DSPs), graphics devices, videogame devices, set-top boxes, micro controllers, cell phones, portablemedia players, hand held devices, and various other electronic devices,are also suitable. In general, a huge variety of systems or electronicdevices capable of incorporating a processor and/or other executionlogic as disclosed herein are generally suitable.

Referring now to FIG. 7, shown is a block diagram of a system 700 inaccordance with one embodiment of the present invention. The system 700may include one or more processors 710, 715, which are coupled to acontroller hub 720. In one embodiment, the controller hub 720 includes agraphics memory controller hub (GMCH) 790 and an Input/Output Hub (IOH)750 (which may be on separate chips); the GMCH 790 includes memory andgraphics controllers to which are coupled memory 740 and a coprocessor745; the IOH 750 is couples input/output (I/O) devices 760 to the GMCH790. Alternatively, one or both of the memory and graphics controllersare integrated within the processor (as described herein), the memory740 and the coprocessor 745 are coupled directly to the processor 710,and the controller hub 720 in a single chip with the IOH 750.

The optional nature of additional processors 715 is denoted in FIG. 7with broken lines. Each processor 710, 715 may include one or more ofthe processing cores described herein and may be some version of theprocessor 600.

The memory 740 may be, for example, dynamic random access memory (DRAM),phase change memory (PCM), or a combination of the two. For at least oneembodiment, the controller hub 720 communicates with the processor(s)710, 715 via a multi-drop bus, such as a frontside bus (FSB),point-to-point interface, or similar connection 795.

In one embodiment, the coprocessor 745 is a special-purpose processor,such as, for example, a high-throughput MIC processor, a network orcommunication processor, compression engine, graphics processor, GPGPU,embedded processor, or the like. In one embodiment, controller hub 720may include an integrated graphics accelerator.

There can be a variety of differences between the physical resources710, 7155 in terms of a spectrum of metrics of merit includingarchitectural, microarchitectural, thermal, power consumptioncharacteristics, and the like.

In one embodiment, the processor 710 executes instructions that controldata processing operations of a general type. Embedded within theinstructions may be coprocessor instructions. The processor 710recognizes these coprocessor instructions as being of a type that shouldbe executed by the attached coprocessor 745. Accordingly, the processor710 issues these coprocessor instructions (or control signalsrepresenting coprocessor instructions) on a coprocessor bus or otherinterconnect, to coprocessor 745. Coprocessor(s) 745 accept and executethe received coprocessor instructions.

Referring now to FIG. 8, shown is a block diagram of a first morespecific exemplary system 800 in accordance with an embodiment of thepresent invention. As shown in FIG. 8, multiprocessor system 800 is apoint-to-point interconnect system, and includes a first processor 870and a second processor 880 coupled via a point-to-point interconnect850. Each of processors 870 and 880 may be some version of the processor600. In one embodiment of the invention, processors 870 and 880 arerespectively processors 710 and 715, while coprocessor 838 iscoprocessor 745. In another embodiment, processors 870 and 880 arerespectively processor 710 coprocessor 745.

Processors 870 and 880 are shown including integrated memory controller(IMC) units 872 and 882, respectively. Processor 870 also includes aspart of its bus controller units point-to-point (P-P) interfaces 876 and878; similarly, second processor 880 includes P-P interfaces 886 and888. Processors 870, 880 may exchange information via a point-to-point(P-P) interface 850 using P-P interface circuits 878, 888. As shown inFIG. 8, IMCs 872 and 882 couple the processors to respective memories,namely a memory 832 and a memory 834, which may be portions of mainmemory locally attached to the respective processors.

Processors 870, 880 may each exchange information with a chipset 890 viaindividual P-P interfaces 852, 854 using point to point interfacecircuits 876, 894, 886, 898. Chipset 890 may optionally exchangeinformation with the coprocessor 838 via a high-performance interface892. In one embodiment, the coprocessor 838 is a special-purposeprocessor, such as, for example, a high-throughput MIC processor, anetwork or communication processor, compression engine, graphicsprocessor, GPGPU, embedded processor, or the like.

A shared cache (not shown) may be included in either processor oroutside of both processors, yet connected with the processors via P-Pinterconnect, such that either or both processors' local cacheinformation may be stored in the shared cache if a processor is placedinto a low power mode.

Chipset 890 may be coupled to a first bus 816 via an interface 896. Inone embodiment, first bus 816 may be a Peripheral Component Interconnect(PCI) bus, or a bus such as a PCI Express bus or another I/Ointerconnect bus, although the scope of the present invention is not solimited.

As shown in FIG. 8, various I/O devices 814 may be coupled to first bus816, along with a bus bridge 818 which couples first bus 816 to a secondbus 820. In one embodiment, one or more additional processor(s) 815,such as coprocessors, high-throughput MIC processors, GPGPU's,accelerators (such as, e.g., graphics accelerators or digital signalprocessing (DSP) units), field programmable gate arrays, or any otherprocessor, are coupled to first bus 816. In one embodiment, second bus820 may be a low pin count (LPC) bus. Various devices may be coupled toa second bus 820 including, for example, a keyboard and/or mouse 822,communication devices 827 and a storage unit 828 such as a disk drive orother mass storage device which may include instructions/code and data830, in one embodiment. Further, an audio I/O 824 may be coupled to thesecond bus 816. Note that other architectures are possible. For example,instead of the point-to-point architecture of FIG. 8, a system mayimplement a multi-drop bus or other such architecture.

Referring now to FIG. 9, shown is a block diagram of a second morespecific exemplary system 900 in accordance with an embodiment of thepresent invention. Like elements in FIGS. 8 and 9 bear like referencenumerals, and certain aspects of FIG. 8 have been omitted from FIG. 9 inorder to avoid obscuring other aspects of FIG. 9.

FIG. 9 illustrates that the processors 870, 880 may include integratedmemory and I/O control logic (“CL”) 972 and 982, respectively. Thus, theCL 972, 982 include integrated memory controller units and include I/Ocontrol logic. FIG. 9 illustrates that not only are the memories 832,834 coupled to the CL 872, 882, but also that I/O devices 914 are alsocoupled to the control logic 872, 882. Legacy I/O devices 915 arecoupled to the chipset 890.

Referring now to FIG. 10, shown is a block diagram of a SoC 1000 inaccordance with an embodiment of the present invention. Similar elementsin FIG. 6 bear like reference numerals. Also, dashed lined boxes areoptional features on more advanced SoCs. In FIG. 10, an interconnectunit(s) 1002 is coupled to: an application processor 1010 which includesa set of one or more cores 102A-N, cache units 604A-N, and shared cacheunit(s) 606; a system agent unit 610; a bus controller unit(s) 616; anintegrated memory controller unit(s) 614; a set or one or morecoprocessors 1020 which may include integrated graphics logic, an imageprocessor, an audio processor, and a video processor; an static randomaccess memory (SRAM) unit 1030; a direct memory access (DMA) unit 1032;and a display unit 1040 for coupling to one or more external displays.In one embodiment, the coprocessor(s) 1020 include a special-purposeprocessor, such as, for example, a network or communication processor,compression engine, GPGPU, a high-throughput MIC processor, embeddedprocessor, or the like.

Embodiments of the mechanisms disclosed herein may be implemented inhardware, software, firmware, or a combination of such implementationapproaches. Embodiments of the invention may be implemented as computerprograms or program code executing on programmable systems comprising atleast one processor, a storage system (including volatile andnon-volatile memory and/or storage elements), at least one input device,and at least one output device.

Program code, such as code 830 illustrated in FIG. 8, may be applied toinput instructions to perform the functions described herein andgenerate output information. The output information may be applied toone or more output devices, in known fashion. For purposes of thisapplication, a processing system includes any system that has aprocessor, such as, for example; a digital signal processor (DSP), amicrocontroller, an application specific integrated circuit (ASIC), or amicroprocessor.

The program code may be implemented in a high level procedural or objectoriented programming language to communicate with a processing system.The program code may also be implemented in assembly or machinelanguage, if desired. In fact, the mechanisms described herein are notlimited in scope to any particular programming language. In any case,the language may be a compiled or interpreted language.

One or more aspects of at least one embodiment may be implemented byrepresentative instructions stored on a machine-readable medium whichrepresents various logic within the processor, which when read by amachine causes the machine to fabricate logic to perform the techniquesdescribed herein. Such representations, known as “IP cores” may bestored on a tangible, machine readable medium and supplied to variouscustomers or manufacturing facilities to load into the fabricationmachines that actually make the logic or processor.

Such machine-readable storage media may include, without limitation,non-transitory, tangible arrangements of articles manufactured or formedby a machine or device, including storage media such as hard disks, anyother type of disk including floppy disks, optical disks, compact diskread-only memories (CD-ROMs), compact disk rewritable's (CD-RWs), andmagneto-optical disks, semiconductor devices such as read-only memories(ROMs), random access memories (RAMs) such as dynamic random accessmemories (DRAMs), static random access memories (SRAMs), erasableprogrammable read-only memories (EPROMs), flash memories, electricallyerasable programmable read-only memories (EEPROMs), phase change memory(PCM), magnetic or optical cards, or any other type of media suitablefor storing electronic instructions.

Accordingly, embodiments of the invention also include non-transitory,tangible machine-readable media containing instructions or containingdesign data, such as Hardware Description Language (HDL), which definesstructures, circuits, apparatuses, processors and/or system featuresdescribed herein. Such embodiments may also be referred to as programproducts.

Emulation (Including Binary Translation, Code Morphing, Etc.)

In some cases, an instruction converter may be used to convert aninstruction from a source instruction set to a target instruction set.For example, the instruction converter may translate (e.g., using staticbinary translation, dynamic binary translation including dynamiccompilation), morph, emulate, or otherwise convert an instruction to oneor more other instructions to be processed by the core. The instructionconverter may be implemented in software, hardware, firmware, or acombination thereof. The instruction converter may be on processor, offprocessor, or part on and part off processor.

FIG. 11 is a block diagram contrasting the use of a software instructionconverter to convert binary instructions in a source instruction set tobinary instructions in a target instruction set according to embodimentsof the invention. In the illustrated embodiment, the instructionconverter is a software instruction converter, although alternativelythe instruction converter may be implemented in software, firmware,hardware, or various combinations thereof. FIG. 11 shows a program in ahigh level language 1102 may be compiled using an first compiler 1104 togenerate a first binary code (e.g., x86) 1106 that may be nativelyexecuted by a processor with at least one first instruction set core1116. In some embodiments, the processor with at least one firstinstruction set core 1116 represents any processor that can performsubstantially the same functions as an Intel processor with at least onex86 instruction set core by compatibly executing or otherwise processing(1) a substantial portion of the instruction set of the Intel x86instruction set core or (2) object code versions of applications orother software targeted to run on an Intel processor with at least onex86 instruction set core, in order to achieve substantially the sameresult as an Intel processor with at least one x86 instruction set core.The first compiler 1104 represents a compiler that is operable togenerate binary code of the first instruction set 1106 (e.g., objectcode) that can, with or without additional linkage processing, beexecuted on the processor with at least one first instruction set core1116. Similarly, FIG. 11 shows the program in the high level language1102 may be compiled using an alternative instruction set compiler 1108to generate alternative instruction set binary code 1110 that may benatively executed by a processor without at least one first instructionset core 1114 (e.g., a processor with cores that execute the MIPSinstruction set of MIPS Technologies of Sunnyvale, Calif. and/or thatexecute the ARM instruction set of ARM Holdings of Sunnyvale, Calif.).The instruction converter 1112 is used to convert the first binary code1106 into code that may be natively executed by the processor without anfirst instruction set core 1114. This converted code is not likely to bethe same as the alternative instruction set binary code 1110 because aninstruction converter capable of this is difficult to make; however, theconverted code will accomplish the general operation and be made up ofinstructions from the alternative instruction set. Thus, the instructionconverter 1112 represents software, firmware, hardware, or a combinationthereof that, through emulation, simulation or any other process, allowsa processor or other electronic device that does not have a firstinstruction set processor or core to execute the first binary code 1106.

Memory Management Apparatus and Method for Compartmentalization UsingLinear Address Metadata

Software is becoming increasingly complex, with different components,functionalities, and security boundaries. In particular, the model ofwell-defined boundaries is often implemented for security, to isolatedifferent components of an application. From a hardware perspective,however, an entire application is in one process address space.Consequently, there is no memory isolation between components and asecurity bug (such as an exploitable memory corruption) in one componentcan lead to the entire application being compromised. Software vendorshave attempted to mitigate this issue by placing these components indifferent processes. While process isolation provides a natural defense,it results in added memory overhead, performance impacts in terms oflatency and responsiveness, and potentially increased power usage.

1. Page Table Extensions

One embodiment of the invention comprises circuitry and/or software toextend existing page table lookups with an additional page walk whichassociates additional metadata (tags) with linear addresses. Theadditional page walk may be performed at various levels of granularity(e.g., 4K, 2M, 1G, 512G, etc). In addition, one embodiment includes asandbox instruction set architecture (ISA) in which a software componentis assigned a sandbox ID. The processor then ensures that all memoryaccess tags in use match the current sandbox ID. If a match is notfound, then the processor may raise a fault and/or take other correctivesecurity measures. These implementations are used to implementhardware-enforced memory isolation between independent softwarecomponents of an application which reside in the same address space.

Page tables are set up by the operating system and used by hardware totranslate virtual/linear addresses to physical addresses. Modernprocessors have run out of available bits in page table entries, largelybecause the available bits are being used by modern operating systems tostore additional information.

The embodiments of the invention may be implemented with different pagetable arrangements and address translation architectures including, butnot limited to, those which use 4-level paging and 5-level paging. Byway of example, and not limitation, FIG. 12 illustrates an example of a4-level paging architecture and FIG. 13 illustrates an example of a5-level paging architecture.

In FIG. 12, control register CR3 1201 stores the base address of a pagemap level 4 (PML4) table 1202. The address translation circuitry 1280uses this value and bits 47:39 of the virtual/linear address 1210 toidentify an entry which identifies the base of a page directory pointertable 1203 in which an entry is identified using directory pointer bits38:30 of the virtual/linear address 1210. The entry from the PDPT 1203points to the base of a page directory 1204 and directory bits 29:21from the virtual/linear address 1210 identify a page directory entry(PDE) pointing to the base of a page table 1205. Table bits 20:12identify a page table entry (PTE) which points to the base of page 1206and a particular physical address 1210 is identified using offset bits11:0 from the virtual/linear address 1210.

Access to the final physical page is subject to permission and faultchecking mechanisms. If permission checks allow access to the page, thena translation lookaside buffer (TLB) is filled with the virtual tophysical mapping so that a subsequent page walk operation is notrequired.

The 5-level paging implementation in FIG. 13 operates in substantiallythe same manner except that the value in control register CR3 points toa page map level 5 (PML5) table and PML5 bits 56:48 of thevirtual/linear address identify a PML5 entry pointing to the base of thePML4 table 1303. The page directory pointer table 1304, page directory1305, page table 1306, and page 1307 containing the physical address1310 are accessed in a similar manner as described above.

One embodiment of the invention extends standard page tables in anorthogonal manner without changing current formatting of page tableentries. These page table extensions allow the processor to associateadditional metadata with virtual/linear addresses and thus provideadditional functionality, such as additional security checks.

In one implementation, page walks are supplemented with a paralleltable, referred to herein as a linear address tag table (LATT) in thephysical address space which is used for tagging of linear addresses.The parallel table may be indexed using the same set of linear addressbits as the standard page table and the tags may be implemented atvarious levels of granularity, which may or may not correspond to thegranularity used by the standard page table. By way of example, and notlimitation, the tags may be implemented at a granularity of 4K, 2M, 1G,or 512G.

The LATT does not resolve linear-to-physical translations nor does itresolve page table permission information. Instead, it allows theprocessor to associate additional metadata (e.g., 16-bit tags) withlinear addresses. In one embodiment, the LATT differs from a normal pagetable in that it is a sparse table and thus has a reduced memorycommitment compared to the normal page tables.

In one embodiment, a LATT page walk can terminate at any level withoutcausing a fault. For example, it may terminate at a PML4E level (orequivalent level) and associate a tag with an entire 512G linear addressrange. One embodiment of a format of a non-leaf LATT paging structure1400, illustrated in FIG. 14, includes the following bit definitions:

Bit 1 (Rsvd)→Reserved bit. Should always be cleared.

Bit 2 (Rsvd)→Reserved bit. Should always be cleared.

Bit 3-18 (CompId)→16 bit tag associated with this address.

Bit 19-M+5 (LowerTabPA)→Page frame number of next LATT paging structure.If it is a leaf entry, then this field becomes reserved.

Bits M+6-63→Reserved bit. Should always be cleared.

M→Maximum Physical Address Width.

FIG. 15A illustrates an exemplary processor 1555 on which embodiments ofthe invention may be implemented including a plurality of cores 0-N forsimultaneously executing a plurality of instruction threads. Whiledetails of only a single core (Core 0) are shown in FIG. 15A, it will beunderstood that each of the other cores of processor 1555 may includethe same or similar components.

The plurality of cores 0-N may each include a memory management unit(MMU) with metadata processing circuitry/logic 1590 for performingmemory operations (e.g., such as load/store operations) and LATTprocessing operations using the techniques described herein. Forexample, address translation circuitry 1580 of the MMU 1590 mayimplement the LATT address translation techniques to allow the core toaccess page tables 1585 and corresponding LATTs 1586 in memory 1500 andto validate the tags associated with page table entries.

In one embodiment, in response to an address translation requestcomprising a virtual address, the address translation circuitry 1580accesses the appropriate set of page table entries in system memory 1585to identify the physical memory address associated with the virtualaddress. The address translation circuitry 1580 concurrently identifiescorresponding metadata from the LATT 1586 associated with the virtualaddress. It may then validate by comparing the tag in the LATT with avalue in a control register associated with the memory region (asdescribed below). If validation succeeds, it may then cache the resultsin a translation lookaside buffer (TLB) 1581 so that it will beavailable for subsequent address translation requests. The resultscached in the TLB 1581 may include data from both the page table entryand the corresponding LATT entry.

The illustrated architecture also includes an execution pipeline whichuses the address translations including an instruction fetch unit 1510for fetching instructions from system memory 1500, the level 1 (L1)instruction cache 1520, the L2 cache 1511, or the L3 cache 1516. Theinstruction fetch unit 1510 also includes a next instruction pointer1503 for storing the address of the next instruction to be fetched frommemory 1500 (or one of the caches); an instruction translationlook-aside buffer (ITLB) 1504 for storing a map of recently usedvirtual-to-physical instruction address translations to improve thespeed of address translation; a branch prediction unit 1502 forspeculatively predicting instruction branch addresses; and branch targetbuffers (BTBs) 1501 for storing branch addresses and target addresses.

A decoder 1530 decodes the fetched instructions into micro-operations or“uops” and an execution unit 1540 executing the uops on a plurality offunctional units. A writeback/retirement unit 1550 retires the executedinstructions and writes back the results to other elements of theexecution pipeline.

The illustrated core architecture also includes a set of general purposeregisters (GPRs) 1505, a set of vector registers 1506, and a set of maskregisters 1507. In one embodiment, multiple vector data elements arepacked into each vector register 1506 which may have a 512 bit width forstoring two 256 bit values, four 128 bit values, eight 64 bit values,sixteen 32 bit values, etc. However, the underlying principles of theinvention are not limited to any particular size/type of vector data. Inone embodiment, the mask registers 1507 include eight 64-bit operandmask registers used for performing bit masking operations on the valuesstored in the vector registers 1506 (e.g., implemented as mask registersk0-k7 described herein). However, the underlying principles of theinvention are not limited to any particular mask register size/type.

Each core 0-N may include a dedicated Level 1 (L1) cache 1512 and Level2 (L2) cache 1511 for caching instructions and data according to aspecified cache management policy. As mentioned, the L1 cache 1512includes a separate instruction cache 1520 for storing instructions anda separate data cache 1521 for storing data. The instructions and datastored within the various processor caches are managed at thegranularity of cache lines which may be a fixed size (e.g., 64, 128, 512Bytes in length).

FIG. 15B illustrates an embodiment which includes a system memorymanagement unit (SMMU) 1590 for performing system-level memorymanagement operations on behalf of all of the cores and any othersystem-level components such as a graphics processor, digital signalprocessor (DSP), and/or PCIe device. The SMMU 1590 includes an L3 cache1516, address translation circuitry 1584 for performingvirtual-to-physical address translations, and a TLB 1583 for caching theaddress translations, which may be synchronized with the addresstranslations in the TLBs 1581 of each core. While illustrated withinprocessor 1556, the SMMU may be on a different chip from the processor1556. The address translation circuitry 1584 of the SMMU 1590 may alsoperform the tag-based memory management techniques described herein.

FIG. 16A illustrates parallel table lookups performed in a set ofaddress translation tables 1601-1605 and linear address tag tables(LATTs) 1621-1624. As mentioned, a control register 1600 stores apointer to the base address of a base translation table 1601 which iscombined with a set of linear address bits (LAB) from the virtualaddress to identify an entry. Each successive level of the translationoperation combines the next set of linear address bits 1682-1685 withthe output of the prior translation 1602-1605 to ultimately generate aphysical address (PA).

In a similar manner, a control register 1620 stores the base address ofa LATT root table 1621 which is combined with the first set of linearaddress bits 1681 to identify a root table entry. The address bits fromthe root entry are combined with the next set of linear address bits1682 to identify the next LATT table 1622. Each successive level of theLATT operation combines the next set of linear address bits 1683-1685with the output of the prior LATT table 1623-1624 to generate a LATT tagvalue.

Permission information from the final page table 1605 is routed to faultcheck logic 1611 which selectively detects fault conditions, potentiallyresulting in a fill to the TLB 1610 (e.g., if the permission checkand/or tag comparison are validated) and/or generation of a faultcondition 1612 (e.g., if the tag from the LATT does not match a tagvalue associated with the memory region and/or the requestor does nothave sufficient permission to access the memory region). Faults may alsobe generated based on the contents of TLB entries even withoutperforming a page walk at the time that the fault is generated. Forexample, if a TLB entry exists for the requested page with a mismatchedCID value, this would generate a fault. However, as mentioned, a faultdoes not need to be generated for early termination of a LATT page walk.

FIG. 16B illustrates a specific example in which LATT lookups areperformed in parallel with the PML4 paging architecture from FIG. 12. Aspreviously described, control register CR3 1201 stores a pointer to thebase address of a PML4 table 1202 and PML4 linear address bits identifyan entry within the PML4 table which points to a page directory pointertable (PDPT) 1203. The directory pointer linear address bits identify anentry in the PDPT 1203 which points to a page directory (PD) table 1204.The directory address bits identify an entry in the PD table 1204 with apointer to page table 1205. The table bits identify an entry in the pagetable 1205 which identifies a page 1206. Finally, offset bits in thelinear address identify an offset into the page 1206 to identify anentry containing the corresponding physical address and associatedpermission information.

The tag lookup operations are performed in parallel with the PML4lookup. In particular, the control register 1620 stores a pointer to thebase address of the LATT root table 1621. The PML4 address bits providean offset to identify an entry in the LATT RT which includes a pointerto the next level LATT 1622. The directory pointer address bits providean offset in LATT 1622 to identify an entry which points to the nextlevel LATT 1623. The directory bits point to an entry in LATT 1623 whichpoints to the final level LATT 1624. The table linear address bits thenidentify an entry within LATT 1624 which includes a LATT tag value.

While the architectures described above include specific numbers oftranslation table stages, the underlying principles of the invention arenot limited to these particular implementations. Various different pagetable architectures and lookup mechanisms may be used with the LATTlookup and management techniques described herein. For example, in oneimplementation, the LATT comprises a single level table with asufficiently large granularity to identify linear addresses for theentire system memory. Alternatively, any number of table levels may beused.

Referring to FIG. 17, the following sequence of operations may beperformed in one embodiment. On a data access, the TLB 1781 is checkedfor an entry associated with the linear address. If one is found, thenthe corresponding physical page address and associated LATT tag value1700 are returned. That is, in the case of a hit, the LATT tag value isalready cached in the TLB entry.

In response to a TLB miss, the processor initiates page table walk via apage miss handler 1710 to collect resolved physical page and permissioninformation from memory 1500. Given that latency is already involvedwith performing the page table 1585 walk, the additional linear addresstag table 1586 walk does not add significantly to the overall latency.The results of both walks are evaluated by walk analysis circuitry/logic1750 and access is either allowed or disallowed based on existingpermissions and/or LATT rules (some examples of which are describedbelow).

If data access is allowed, then TLB fill circuitry/logic 1751 updatesthe TLB 1781 with a new entry corresponding to the walk. As mentioned,in addition to the physical address and permission data, the new entrymay include the tag data and other metadata associated with the entry.Once the entry is filled in the TLB 1781, subsequent access with thesame linear address will result in a TLB hit and neither of the walksare required.

FIG. 18 illustrates one embodiment of a process for LATT page walks. Anaccess check operation 1801 is initially performed, and if the accesscheck 1801 validates the operation (e.g., a tag match and/or permissionvalidation), the next operation 1804 determines whether to terminate thewalk based on another set of rules. For example, if the final tag dataand page table entry has been reached, then the walk terminates and walkresults 1810 are generated (e.g., comprising a valid physical addresswhich may be cached in the TLB). If the walk is not terminated at 1804,then additional access checks 1801 may be performed on the returned datauntil the walk terminates.

In one embodiment of the access check operation, 0xFFFF is a special tagto allow access to all compartments. Thus, if this tag is detected anycompartment is permitted to access this memory. If the tag is not0xFFFF, then tag is checked against the current tag ID (CurrCompId)which may be stored in a control register such as a model-specificregister (MSR). In one embodiment for an x86 implementation, this is anew register referred to as IA32_COMP_CONFIG. If a match is found, thenfurther access is permitted. If the tag does not match, access isdenied. In one embodiment on an x86 architecture, the following codesequence is implemented to perform the access check operation 1801:

 If LATTx_ENTRY.ConnpId = = 0xFFFF, then   BoolTagPass = TRUE Else ifLATTx_ENTRY.CompId = = CurrCompId, then   BoolTagPass = TRUE Else  BoolTagPass = FALSE If IA32_COMP_CONFIG.InNonNativeDomain = = 0 &&LATTx_ENTRY = = 0x0000   BoolTagPass = TRUEIn one embodiment, if in the native domain andLATTx_ENTRY.CompId==0x0000, then the memory access may be allowedbecause the implicit tag for native domain is 0x0000.

If an access check 1801 determines that access should be denied at anypoint in the walk process, then a fault code indicating the type offault is stored in a fault register 1612 (e.g., TAG_FAULT_INFO). In oneembodiment, the mismatched tag and report #PF is stored in the faultregister with a page fault error code indicating that a LATT faultoccurred. If the walk successfully completes (i.e., all access checkswere validated), then the TLB 1781 is filled with the LATTx_ENTRY.CompIdtag value.

In an alternative embodiment, LATT tables could be indexed based onPhysical Addresses (PAs) of pages of memory. In virtualized systems,multiple levels of PAs may be defined, since Guest Physical Addresses(GPAs) may be translated to Host Physical Addresses (HPA) using a secondlevel of paging. Instead of indexing each level of the LATT tables usinga slice of linear address bits, a slice of physical address bits may beused instead.

An advantage of indexing LATT tables by physical addresses is that asingle LATT table can be used across multiple processes in anunvirtualized system or in a virtualized system if the LATT tables areindexed using GPAs. If the LATT tables are indexed using HPAs in avirtualized system, then a single LATT table can even be used acrossmultiple Virtual Machines (VMs).

A disadvantage of indexing LATT tables by physical addresses is thatwhen memory is remapped, e.g. due to swapping a page out to disk, thecorresponding LATT table entry may also need to be updated.

In an alternative embodiment, LATT table entries could be associatedwith a sub-page region of memory to support finer-grained securitypolicies. Since TLB entries typically refer to a single page, thisembodiment could store multiple LATT tag values in the correspondingpage-granular TLB entry, or it could generate a separate TLB entry foreach sub-page region.

2. Compartmentalization Architecture

As mentioned, one embodiment of the invention includes acompartmentalization architecture, which introduces the notion of acompartment identifier (“CID”). This CID value may be programmed into aspecified control register of the processor/core. In one specificimplementation, CID is a 16-bit identifier, although any number of bitsmay be used (e.g., 8 bits, 32 bits, 64 bits, etc). The CID uniquelyidentifies a compartment, allowing 64k compartments to be allocated in asingle process address space. In one embodiment, all data accesses aretagged if compartmentalization is enabled and the tag for a data accessmust match the current (active) compartment identifier programmed in thecontrol register processor (e.g., a portion of the tag must be the CIDvalue).

Below is a description of one specific set of ISA definitions for an x86processor/core. This embodiment will be described with respect to FIGS.19A-C which illustrate three control registers: IA32_COMP_CONFIG MSR1901, a LATT_ROOT Control Register 1902, and a TAG_FAULT_INFO register1903. Note, however, the underlying principles of the invention are notlimited to these specific details and may in fact be implemented on anyprocessor architecture with different types of control registers andcontrol fields.

Compartments and Compartment Identifier (CID):

Each compartment can be uniquely represented by a 16-bit compartmentidentifier (CID).

Current Compartment ID (CCID):

This is the current (active) compartment on a processor/core and isprogrammed in the ‘CurrCompId’ field of the IA32_COMP_CONFIG MSR (e.g.,encoded in bits 17:2 of the IA32_COMP_CONFIG MSR 1901). Note that thetransition from non-native compartment to native compartment does notchange the current compartment ID.

Native Compartment: To allow application software to implementcompartmentalization efficiently and manage compartments, one embodimentof the invention includes a special compartment referred to as the“Native” compartment, which has a compartment ID value of 0x0000.

In one particular implementation, the native compartment is defined bythe ‘InNonNativeComp’ bit in the IA32_COMP_CONFIG MSR 1901 (e.g., bit 1in FIG. 19A). If software is executing in user mode and‘InNonNativeComp’ is clear, the processor/core is executing in a nativecompartment. Note that this MSR can't be modified by user mode code andthus OS/Kernel can decide which piece of user mode code can act as thenative compartment. In one embodiment, the native compartment relies onthe user mode compartmentalization ISA described herein to implementnon-native compartments.

In one implementation, the following data accesses are permitted fromthe native compartment:

Accesses using linear addresses tagged with tag=0x0000; and

accesses using linear addresses tagged with tag=Current Compartment ID(CCID).

Non-Native Compartment:

Non-native compartments are true compartments which are managed by thenative compartment. Non-native compartments can be represented bycompartment IDs other than 0x0000 and 0xFFFF. If the ‘InNonNativeComp’bit in IA32_COMP_CONFIG MSR 1901 is set, this means that theprocessor/core is executing in the non-native compartment.

COMP_U:

This is a new instruction leaf for managing user mode compartments. Oneembodiment also includes a COMP_S instruction depending in circumstanceswhere there is a use case for supervisor software. In one embodiment,the RAX register provides an indication of which leaf has to be invoked.

COMP_U[ENTER].RCX—This is a leaf of COMP_U which allows program code toenter into a compartment. Software must program RCX with the CompartmentID to make it the active Compartment ID. After a successful completionof this instruction, the processor/core will update the ‘CurrCompId’field in IA32_COMP_CONFIG MSR 1901 with the RCX value. This will alsoset ‘InNonNativeComp’ bit in the IA32_COMP_CONFIG MSR 1901 to indicatethat compartment execution is now in a non-native compartment. This leafwill result in #UD in the non-native compartment.

COMP_U[EXIT]—This leaf of COMP_U allows software to exit a compartmentwillingly. This leaf will result in #UD in the native compartment.

COMP_U[CURR_COMP_ID]:RAX—This leaf of COMP_U returns the currentCompartment ID to software in the RAX register. This leaf is permittedin both native and non-native compartments.

Processor/Core Registers: One embodiment of the invention includes thefollowing new registers/MSRs illustrated in FIGS. 19A-C. These registersmay be used to assist in compartmentalization as described herein.

IA32_COMP_CONFIG MSR 1901—This MSR is unavailable for direct access touser mode code.

-   -   En (bit0)—If set, enables compartmentalization ISA and LATT in        user mode.    -   InNonNativeComp (bit1)—If set, processor is executing non-native        compartment. If clear, processor is executing native        compartment.    -   CurrCompId (bit2-17)—Contains the Compartment ID of the        currently active non-native compartment.    -   COMP_EXIT_RIP—Points to the instruction pointer where control        will be transferred after the compartment executes COMP_U[EXIT]        leaf.

LATT_ROOT Control Register 1902:

The LATT_ROOT control register is accessible to supervisor mode only andpoints to the root (physical address) of the linear address tag table(LATT). Reserved fields must be cleared and ROOT_LATT_PA is a 4K alignedphysical address of the root of the LATT.

TAG_FAULT_INFO register 1903:

This register is accessible to supervisor mode only and is used forreporting fault info pertaining to LATT page walk.

The MismatchedTagId field reports the tag present in the LATT tablewhich did not match with rules with respect to current Compartment ID ofprocessor. This information will help the page fault handler of theoperating system to take corrective actions related to tag assignment tocompartments.

FIG. 20 illustrates a specific example in which a particular browser(Chrome) uses process memory to launch various JavaScripts as differentsandboxes in the same process. For example, if a user opens‘www.cnn.com’ in the browser, there are many other elements which showup in the webpage such as ads.

Using the compartmentalization and LATT techniques described herein, asingle native compartment 2050 is defined with a corresponding processaddress space 2001 and separate isolated compartments C1-C4 are definedfor the other elements incorporated in the webpage which are completelyisolated in the process address space. Specifically, in this example thefour different patterns differentiate four different JavaScriptinstances in the same address space. Compartment C1 includes components2001-2003, C2 includes components 2011-2013, C3 includes 2021-2023, andC4 includes components 2031-2033.

In an alternative embodiment, additional registers are defined beyond asingle CurrCompId to match against more compartment ID values. Forexample, some compartment ID values may be assigned for the private dataaccessible only to individual compartments, and other compartment IDvalues may be assigned to data that is shared across multiplecompartments. In this embodiment, a number of additional registers areprovided (e.g., and identified as SharedCompIdX, where X is the registernumber), to permit access to that number of shared compartment IDs. Whenswitching to a compartment, each SharedCompIdX register may beinitialized with the compartment ID values for the shared data that isauthorized to be accessed from that compartment.

In an alternative embodiment, an additional register, e.g. labeledSharedCompIdEnable, may comprise enable bits for individualSharedCompIdX registers so that a SharedCompIdX register may only matcha CID value if its corresponding enable bit in SharedCompIdEnable isset. This may enable software to update just a single register,SharedCompIdEnable, when switching compartments to select the accesspermissions for the destination compartment instead of updatingindividual SharedCompIdX registers.

Another useful way of assigning compartment ID values is to grant onecompartment access to data in a different compartment in a sandboxingmodel. One particular implementation will be described with respect toFIGS. 21-22.

As illustrated in FIG. 21, a cryptographic library compartment 2100 witha protected key 2100 efficiently processes data in an application 2201without requiring that it first be copied into the cryptographic librarycompartment 2100 and later copied back into the application compartment2101 by treating the application as a sandbox that is denied access tothe protected key 2105 in the cryptographic library compartment 2100.

Preventing the application 2101 from accessing the protected key 2105can be enforced by configuring the SharedCompId0 register 2107 to denyaccess to any additional pages of memory beyond those pages alreadygranted by the configuration of the CurrCompId register 2106. Grantingthe cryptographic library 2100 access to an application buffer 2110containing the data to be processed by the cryptographic library 2100can be accomplished by setting the SharedCompId0 register 2107 to thevalue of CurrCompId 2108 used by the application 2201.

However, drawbacks of defining many additional SharedCompIdX registersare that they each require time to initialize, memory may need to beallocated in saved context areas to store the SharedCompIdX registervalues (for subsequent restore operations), and they may consumeadditional silicon area and energy for access checks.

An alternative embodiment to minimize these drawbacks is to definemultiple compartment ID values for shared data using a pair ofregisters. For example, a contiguous range of compartment ID values canbe specified using a pair of registers containing a lower bound(SharedCompIdX.LB) and an upper bound (SharedCompIdX.UB), respectively,on the ID values. Any page with a compartment ID value within thespecified range would be accessible. Another example is to specify abase (SharedCompIdX.Base) and mask (SharedCompIdX.Mask) for accessiblecompartment ID values such that if the result of performing a bitwiseAND operation on the base register value and the mask register valuematches the result of performing a bitwise AND operation on thecompartment ID for a page and the mask register value, then access tothe page is authorized.

Referring now to FIG. 22, specifying ranges of shared compartment IDvalues is especially useful for supporting nested sandboxes 2201-2204.The illustrated example comprises a hierarchical nested arrangement withsandbox 2201 comprising a parent to sandbox 2202 and 2204, and withsandbox 2202 comprising a parent to sandbox 2203. In one embodiment,each parent sandbox such as sandbox 2201 is authorized to access thecode and data of any sandbox that it contains directly or that istransitively contained within any of its direct children 2202, 2204.This can be enforced by allocating compartment IDs for a hierarchy ofnested sandboxes contiguously so that the SharedCompIdX.LB andSharedCompIdX.UB can be set to cover the entire range of compartment IDsthat are authorized for access from the current level of the nestinghierarchy.

In an alternative embodiment, a permission override field may beincluded alongside each set of registers that matches CIDs. Instead ofdirectly using permissions computed from the page walk, the permissionsmay be modified based on the permission override field. For example,each permission override field may comprise a read, write, and executebit. The permissions specified by those bits may completely replace thepermissions determined by the single- or multi-dimensional page tablewalk for a page with a matching CID.

Alternatively, the permission override bits may limit the permissionsdetermined by the page table walk. For example, if the permissionsdetermined by the page walk for a page are read and write, with executedisabled, whereas the permission override bits in a register thatmatches the CID for the page indicate read and execute permissions, thenthe effective permissions may be read-only. The processor may require apermission to be granted both by the page table walk and the permissionoverride bits for the permission to ultimately be granted to thesoftware.

Alternatively, the permission override bits may upgrade the permissionsdetermined by the page table walk. For example, if the permissionsdetermined by the page walk for a page are read-only, whereas thepermission override bits in a register that matches the CID for the pageindicate write permissions, then the effective permissions may be readand write. The processor may require a permission to be granted eitherby the page table walk or by the permission override bits for thepermission to ultimately be granted to the software.

Furthermore, some embodiments may use the unmodified permission bitsdetermined by the page table walk for pages with CIDs that do not matchany of the registers containing permission override bits. Alternativeembodiments may treat pages with CIDs that do not match any of theregisters containing permission override bits as being inaccessible.

Some embodiments may include permission override bits in LATT entriesand combine them with permission bits from the page table and theregisters containing permission override bits, if such registers areincluded in the embodiment, to compute the permissions granted tosoftware. For example, the permission bits in an LATT entry with a CIDmatching a CurrCompId or SharedCompIdX register may replace, limit, orupgrade the permission bits from the corresponding page table entry, andthen the resultant intermediate permission bits may be further limitedor upgraded by the permission bits in the matching register, if suchbits are stored in the matching register.

In some embodiments, a bit may be defined in page table entries todisable read access. This may be used in combination with otherpermission bits that may be configured to disable write and executeaccess so that a page table entry simply provides address mappinginformation without granting any permissions to the page by default.Permission bits in LATT entries or CurrCompId or SharedCompIdX registersmay then be used to upgrade the permissions for such pages in particularsubprocesses.

The global bit in a page table entry indicates that the page mappingshould be accessible across all processes. In some embodiments, theglobal bit in page table entries for usermode pages may not be used tomark any such pages as globally-accessible. That bit may be redefined ina new mode to be the read disable bit to avoid needing to redefine otherbits in the page table entry that may be used by software. In otherembodiments, an ignored page table entry bit may be redefined as theread disable bit so that it can be used both for usermode and kernelpages.

As another example, each four bit override may selectively upgrade eachof the read, write, and execute permissions individually, with a singlereserved bit to align the groups of permission overrides to a power oftwo boundary. This reserved bit may be used it indicate if theassociated page has been accessed or is dirty. That is, the reserved bitmay be used to encode the accessed bit or dirty bit found inconventional page table entries (PTE).

In an embodiment where the PIT permissions pages can only improve (i.e.,make less restrictive) the root CR3 permissions, the CR3 register (orother base address control register) may contain a “root-PCID” whose tagmay be looked up in the TLB in parallel or before looking up the “perPIT entry PCID” associated tag in the TLB. This is an optimization wherethe root CR3 page table tag mappings may be shared across allsub-processes in the TLB (effectively allowing those TLB mappings andpermissions to be reused). Only if the permissions in the root TLB entryraise a fault, or there is no root TLB entry found, then the PIT entryPCID would be used (or associated permissions looked up). Thiseffectively makes the Root-PCID a global PCID across all sub-processesthat sub-process PIT entries may override the permissions.

Access to the CurrCompId, SharedCompIdX, and SharedCompIdEnableregisters may be restricted to software in designated processorprivilege levels, e.g. an operating system running in supervisor mode,to regions containing code that is trusted to update those registers, orto software running with the ‘InNonNativeComp’ bit in theIA32_COMP_CONFIG MSR 1901 cleared. In an alternative embodiment, controltransfers between compartments may be accelerated by providing aninstruction to allow software that is not trusted to arbitrarily updatethe CurrCompId, SharedCompIdX, and SharedCompIdEnable registers toperform control transfers that have been pre-authorized by trustedsoftware. Those pre-authorization decisions can be represented in memoryby a compartment table containing entries with settings for theCurrCompId, SharedCompIdX, and SharedCompIdEnable registers. Thecorresponding registers may be initialized to those values when enteringthe compartment. Each compartment table entry may also specify anauthorized entrypoint into the compartment that may be used toinitialize the instruction pointer when entering the compartment. Eachcompartment table entry may also contain a present bit to indicatewhether the compartment table entry is present. The base address for thetable may be referenced by a register, such as an MSR, that is onlyaccessible from trusted software.

An instruction, e.g. a COMP_U[SWITCH].RCX leaf of COMP_U, may accept acompartment table entry index as an input operand in the RCX registerand switch to the compartment settings contained in that compartmenttable entry. If the selected compartment table entry is not present,then a fault may be generated.

In an alternative embodiment, an instruction may be defined, e.g.labeled NarrowSharedCompIdEnable, to enable untrusted software toselectively clear bits in the SharedCompIdEnable register. It may acceptan input operand specifying bits that indicate which bits in theSharedCompIdEnable register should be cleared so that the correspondingSharedCompIdX registers are inactivated. If a SharedCompIdEnable bitindicated in the operand to the NarrowSharedCompIdEnable instruction isalready cleared, then that bit may remain cleared.

In another alternative embodiment, an instruction may be defined, e.g.labeled NarrowSharedCompId, that accepts three operands:

-   -   1. An index identifying a particular SharedCompIdX register that        specifies a lower bound and an upper bound for matching CIDs.    -   2. A new lower bound for the selected SharedCompIdX register.    -   3. A new upper bound for the selected SharedCompIdX register.

The NarrowSharedCompId instruction may first check whether the new lowerbound is lower than the existing lower bound in the selectedSharedCompIdX register or the new upper bound is higher than theexisting upper bound in the SharedCompIdX register. If either of thoseconditions is true, then the NarrowSharedCompId instruction may generatea fault. Otherwise, the NarrowSharedCompId instruction may setSharedCompIdX.LB to the specified new lower bound and it may setSharedCompIdX.UB to the specified new upper bound.

In another alternative embodiment, an instruction may be defined, e.g.labeled NarrowPermissions, that accepts two operands:

-   -   1. An index that selects a CurrCompId or SharedCompIdX register.    -   2. A bitmask for the permission override bits associated with        the selected CurrCompId or SharedCompIdX register.

The NarrowPermissions instruction may operate by modifying thepermission override bits in the selected register so that they mayreduce the permissions granted to software for pages with matching CIDs.For example, if the permission override bits replace or limit the pagepermissions or if they upgrade page permissions, then theNarrowPermissions instruction may clear any bit in the permissionoverride bits in the selected register that is not also set in thebitmask operand.

The NarrowSharedCompIdEnable, NarrowSharedCompId, and NarrowPermissionsinstructions may be used by software to reduce the needed number ofcompartment table entries. A compartment table entry may initiallyprovide access to many pages with many permissions and then untrustedcode A in the compartment may drop permissions using theNarrowSharedCompIdEnable, NarrowSharedCompId, and NarrowPermissionsinstructions so that code B that runs subsequently in the compartmenthas less access due to reduced permissions. Code A may contain a staticset of instruction operands for reducing the permissions for code B, orit may dynamically compute the instruction operands for reducing thepermissions for code B.

This could have also been accomplished without theNarrowSharedCompIdEnable, NarrowSharedCompId, and NarrowPermissionsinstructions by creating a separate compartment table entry for the codeB specifying just the reduced permissions for code B, but that has thedisadvantage of consuming an additional table entry that needs to beinitialized by trusted software, which may impose additional overhead.

In one embodiment of the walk termination determination 1804, if accesswas not allowed from the access check operation 1801, then the walk isterminated for this reason. In addition, regardless of the access check,if the last stage of the page table lookup has been reached, then thewalk is terminated (i.e., because the physical address has been locatedin a page table entry). In one embodiment, LATTx_ENTRY.Term being setmeans that the walk should be terminated. If the walk does not need tobe terminated, then it is continued through the multiple LATTtranslation structures 1621-1624 to generate walk results 1810.

Thus, using the LATT techniques described herein, browsers or any othertype of program code/application can use sub-process sandboxing toimprove security. In particular, these embodiments of the inventionallow software to take advantage of hardware guaranteed sub-processmemory isolation, resulting in a variety of benefits including a reducedmemory footprint (process based isolation techniques tend to utilizemore memory), improved performance because the compartmentalizedprocesses are executed in the same address space (reducing kerneltransition time); and improved security as more privileged componentsfrom the kernel can move into user space with heightened security andisolation guarantees, paving the path for microkernel design.

Apparatus and Method for Efficient Process-Based Compartmentalization

Due to side-channel concerns within a shared address space, the industryis moving increasingly to fine-grain process separation to providesecurity between compartments. The embodiments of the invention improvethe efficiency of process separation techniques by sharing page tablestructures (shared address space) and providing directed addressvector/branch targets and a pure user space process switching mechanismthat may be controlled by process group configurations and customprocess permissions.

On existing implementations, process context identifier (PCID) valuesare used to distinguish between address spaces assigned to differentprocesses. On certain architectures, address space identifiers or ASIDvalues are used to distinguish between address spaces.

Referring back to FIG. 12, when a process is swapped in for execution bya core, the base address stored in control register CR3 1201 includesthe PCID value associated with that process (e.g., on some x86implementations, the PCID value is stored in bits 11:0 of CR3). In thisway, the PCID value can be used to distinguish between different addressspaces for different processes. The PCID value and/or other addressspace identifier may also be cached in the core's TLB along with thecorresponding virtual-to-physical address translations performed onbehalf of a process. To save space within the TLB, a value derived fromthe PCID/address space identifier or other information that is smallerthan that combined input information may be stored in the TLB toidentify the address space context associated with each TLB entry. Forexample, a hashing algorithm may be used to combine those inputs. As aresult, the TLB entries associated with the PCID or other address spaceidentifier can be maintained when the process is swapped out becausethey can be distinguished from other entries associated with otherprocesses.

Embodiments of the invention define a grouping mechanism for CR3 pagingstructures and process context identifiers (PCIDs) into “superprocesses.” In one implementation, a root control register is shared byprocesses to access multiple PCID index mappings, where each PCID indexprovides a “customization” to the root paging structure. This groupconstitutes a super-process configured by supervisory software (e.g.,the operating system kernel). In one embodiment, the root controlregister comprises a CR3 register or a new control register or MSR whichstores a reference to a physical page (e.g., a guest physical address(GPA)) containing an indexed list of PCID values and their correspondingroot paging structures (e.g., sub CR3 registers).

FIG. 23 illustrates one embodiment of this indexed list, referred toherein as the PCID Index Table (PIT) 2300. Each entry in the PIT 2300includes a unique PIT index value which is associated with a PCID valueand a physical address of the root paging structure for this PCID. Thebase address of the PIT 2300 is read from the root control registerwhich is combined with a PIT index value to identify an entry in thePCID index table 2300. The corresponding physical address (e.g., a PML4address in one embodiment) is read from the entry to identify the rootpaging structure for this particular PCID.

One embodiment of the invention includes an instruction to switch thePCID index among a group of customized paging structures that canoverride or customize the basic root paging structure (e.g., the CR3paging structure in some processor implementations). One example of thisinstruction is as follows:

SWITCHSP (PITindex, LinearAddress);

which sets the root control register with the PIT index value for a newsub-process and jumps to the linear address.

In one embodiment, the basic page table structures or portions of thebasic page table structures are shared between sub-processes. However,permissions may be set differently for each sub-process and/or there maybe some unique memory mappings which are different from the basic rootstructure.

In one embodiment, modified permissions are provided by first walkingthe paging structure identified by the PCID index, collecting anypermissions or page mappings, and then walking the basic root pagingstructure, overriding any mappings or permissions from the basic rootpaging structure that were also found in the PCID-indexed PIT pagingstructure. Alternatively, the root CR3 paging structure can be walkedfirst followed by the PCID-indexed paging structure to determine ifthere are any overridden permissions or mappings indicated in thePCID-indexed paging structure for the given linear address.

FIG. 24 illustrates a method in accordance with one embodiment of theinvention. The method may be implemented within the context of thearchitectures described above, but is not limited to any particulararchitecture.

At 2401 a sub-process is swapped in for execution on a core (e.g., Core0 on processor 1555) at a specified PIT index. If the index is valid,determined at 2402, then at 2406, it is used to perform a lookup in thePIT 2300 to identify the PCID value and paging structure root physicaladdress (PA) and a jump is performed to the specified linear address. Ifthe index is invalid, then an exception/fault is returned at 2403.

In one embodiment, the user space process switch instruction is not aSYSCALL which would require a call to a privilege level 0 systemcomponent. Rather, it is a far jump/branch instruction that takes thelinear target address (e.g., LinearAddress in the instruction SWITCHSP(PITindex, LinearAddress)) and specifies a PCID index value (e.g.,PITindex) which may be provided as an instruction immediate or as aregister value.

In one embodiment, at 2402, the memory management unit 1590 of theprocessor will first check that the specified PCID index value is partof the super-process group in the PCID index table 2300. If so, it willthen switch to the PCID and paging structure specified in the PIT 2300identified by the index and, at 2404, will check for a directed addressvector (DAV) or ENDBRANCH instruction indicating a sub-process switchingentry point in the receiving sub-process (e.g., the branch target). Thisway, software can specify any number of branch targets in the codeitself, without the need to list entry points specifically in the PIT,although this may be done in an alternate embodiment of the invention.

In one embodiment, the PCID values from the PIT 2300 are used(indirectly) to tag TLB 1781 entries, where each PCID index valueidentifies a PCID value for the indexed paging structure (identified bythe PCID Index PA). In this implementation, the memory management unit1590 maps the PCID to a field in each TLB entry associated with theprocess, which is used as an address space identifier tag. As previouslymentioned, the full PCID may not be directly stored in each TLB entry,but rather used as one input to compute an address space identifierwhich may be stored in the TLB entry. Thus, when searching the TLB at2407, only entries containing this PCID and/or address space ID valueare searched. In response to a TLB hit, the address mapping andpermissions are read from the TLB at 2408 and the process ends.

In response to a TLB miss at 2407, however, at 2409 the PIT indexedpaging structure is walked first by the page miss handler (PMH) runningon the processor. If a mapping is found at 2410, the walk is terminatedand a new TLB entry with the PCID tag is cached. If a mapping is notfound (e.g. not present in the PIT-indexed paging structure), or onlypermissions are found, the results are stored (e.g., in a PMH stateregister or other control register). The CR3 paging structure is thenwalked at 2411 to retrieve the memory mapping and/or the permissions(depending on what was found in the PIT-indexed walk). Note that if thePCID mapping is not present, the CR3 mapping/permissions are used bydefault. The results are then stored in a TLB entry at 2413 using thePCID tag.

If only the permissions are to be used from the PIT-indexed pagingstructure, this means that the leaf of the PIT-indexed paging structureindicates permissions, but does not include a valid memory mapping. Inone implementation, this is accomplished using an invalid physicaladdress for the page, such as by setting the PA to a default/specialvalue (e.g., MAX_PA+1 indicating no page mapping). If the PIT-indexedpage is not present, then the CR3 page walk results are used instead andassociated with the TLB entry using the PCID and/or address space IDtag.

FIG. 25 illustrates the different sets of translation tables used in oneembodiment. First, using the PIT index value 2502 and base PIT addressstored in a control register 2501, an entry in the PIT is identifiedwith a physical address pointing to the next level translation table2502 (a PML4 table in the specific example). Bits 47:39 of the linearaddress 2500 provide an offset to identify an entry in the PML4 table2502 which provides the next physical address (PA) to identify the baseof the PDPT 2503. The PA may be a guest physical address in avirtualized system or a physical address in an unvirtualized system. Insome embodiments, it may be a host physical address. Bits 38:30 identifyan entry within the PDPT 2503 which identifies the base address of thePD 2504 and bits 29:21 of the linear address 2500 identify an entrywithin the PD 2504. The resulting HPA identifies the base of a pagetable 2505 and bits 20:12 identify a specific page table entry pointingto a page 2506. At this stage, if the mapping provides both a validphysical address and permissions, then these results are stored in a TLBentry which is tagged with the relevant PCID value.

If no valid address mapping is found, or if only permissions are found,then a walk is performed through the CR3-based page tables. Inparticular, the CR3 register stores the base address for the PML4 table1202 within which bits 47:39 identify the relevant entry containing thephysical base address of the PDPT table 1203. The remaining operationsare performed as described above (see, e.g., FIG. 12 and associatedtext) until the page 1206 is located. As mentioned, if permissions werefound in the PIT-index paging structure 2502-2506, then thesepermissions may be used in place of any permissions found in the page1206 and stored in the TLB.

Alternatively, or in addition, the permissions found in the page 1206may be used in accordance with any of the permission managementtechniques described above. For example, permissions may be determinedusing permission override fields which modify, limit, and/or upgrade thepermissions determined by the page table walk.

In an alternate embodiment, a lookup is initially performed within theroot base table before searching the PIT indexed table, or vice versa.The underlying principles of the invention are not limited to theparticular order in which the table lookups are performed. Moreover, insome embodiments, the tables (or some portion thereof) are looked up inparallel.

An example page walk using a 5-level paging architecture is illustratedin FIG. 26. The first sub-process paging structure is the PML5 rootpaging structure 2600 identified by the PIT 2300 entry using the PITindex 2502. The first page walk through the PIT-indexed paging structure2601-2604 is performed as described above to reach a data page 2605. Ifthe data page 2605 mapped to by the linear address is valid, the walkterminates and the TLB is updated with an entry containing thePCID/address space ID tag, the physical address, and permissions.

If only permissions were found but not a valid page mapping, then thesecond walk is performed, identifying the PML5 root 1302 using theaddress in CR3 1301 and proceeding through the stages of the lookup1303-1306 until the corresponding data page 1307 is located to determinethe physical address associated with the linear address. In oneembodiment, the permissions found in the PIT-index paging structure walk(e.g., in page tables 2601-2604 that map to the data page 2605) overrideany permissions found in the page tables 1302-1306 that map to data page1307. Any of the alternate/additional techniques described above formanaging permissions described above may also be used. If a simpleoverride is performed, then the resulting TLB entry will include thepermissions from the first walk with the physical address from thesecond walk.

The TLBs may assume that super processes share the same memory mappings,but have different permissions across groups. As such, the ASID spacemay be divided into a shared address space (mappings) and a list of tagsfor the CR3/PCID-specific permissions of the sub-process. By way ofexample, and not limitation, Protection Keys may also be used within thesub-processes to achieve this.

On current systems, an operating system running in ring-0supervisorymode is typically required to perform CR3 switching. In contrast, theembodiments of the invention described here allow a ring-3 user spaceprocess to switch to a sub-process without operating systemintervention.

In one embodiment, the sub-process space is assigned by the kernel,virtual machine monitor (VMM), or other privileged software entity usingan indexed array such as the PCID index table 2300. This may be done viaa VMFUNC EPTP-List operation or a similar operation. The difference hereis that instead of switching extended page table pointers (EPTPs), theprocess is switched into a PCID index identifying a new paging structureand corresponding PCID value. The OS kernel or VMM may configure the PITpage 2605, entry by entry, and a new control register 2501 or a VirtualMachine Control Structure (VMCS) field is defined to identify thephysical base address for the PIT 2300. The CR3 register 1301 thencontains the root page table with base permissions and page tablemappings across all the PIT entries. Like host-based linear addresstranslation, the individual PIT entries also point to a page table(paging structure), but this is a sub-process page table primarilyconcerned with permission overrides and memory mappings. Thissub-process information only modifies a subset of the paging structure,sparsely populating just those regions of memory (linear address pages)that have permissions overridden, whereas the CR3 paging structure isfully populated and shared across the subprocesses. For portions of thesubprocess page table which are not present, the memory management unit1590 will then defer to the root CR3 1301 paging architecture, whichcontains all the memory mappings. Like an EPTP List index, oneembodiment of the invention includes an index register that indicateswhich PIT entry is current for the process.

One embodiment of the invention performs permission page optimizationsas illustrated in FIGS. 27A-B. To make the permission paging structureeven more memory efficient, the page directory 2603 and page table 2604are merged into one leaf, the permissions page 2710. In thisimplementation, each of the 32K bits on the page 2710 represents thepermission override for a set of 8 pages (or 16 pages for two bitpermission overrides, or 32 pages for four bit permission overrides).For example, each single bit override may operate as a write-enable bitif the CR3 root permission is read only, or may operate as a read-enablebit if the CR3 root permission is not readable.

As another example, each two bit override may operate as an encoding ofpermissions for the associated page or memory region. For example:override bit value 00 means the page is inaccessible. Bit value 01 meansthe page is readable, bit value 10 means the page is both readable andexecutable. And an override bit value 11 means the page is readable andwriteable. Other embodiments may substitute alternative encodings, suchas a 10 bit value indicating the page is executable only. Alternatively,each two bit override may incrementally improve a base permission. Forexample, if the root mapping permission is execute-only, then anoverride value of 00b maintains the base permission, override value of01b makes the page readable and executable, 10b makes the pageexecutable and writeable, and an override value of 11b makes the pagereadable, writeable and executable. As a third example, each four bitoverride may selectively upgrade each of the read, write, and executepermissions individually, with a single reserved bit to align the groupsof permission overrides to a power of two boundary.

In alternative embodiments, the permissions page 2710 may be expanded torequire 8 pages of storage for one bit permission overrides so that eachbit overrides the permissions for a single page. Similarly, thepermissions page 2710 may be expanded to require 16 or 32 pages ofstorage for two bit or four bit permission overrides, respectively, sothat each permission override applies to a single page.

FIG. 27B illustrates how a permissions override operation is applied toa region 2700 of the CR3 hierarchy including a particular PD page 1305,and all associated page table pages 1306, 2706 and data pages 1307, 2707(i.e., all paging structures beneath the PD page 1305 in the hierarchy).Thus, the bits specified in the permissions page 2710 will set thepermissions for this particular region 2700 of the CR3 paging structure.

In one embodiment, if a bit is set in the permissions page 2710, thepermissions of the group of 8 pages changes to one level above (e.g.,+1) the permissions of the root CR3 superprocess paging structure. Usingthis technique, one page can store permissions for 32K*8 pages (one bitper page*8). If the page is not present in the root CR3 superprocesspaging structure, then it is also not present in the PIT-indexed pagingstructure regardless of the permissions page override. In this way, theOS only needs to manage updates to the root CR3 superprocess pagingstructure for memory mappings (i.e., only one paging structure needs tobe updated when paging to/from storage). A new page table entry bit maybe used to indicate if the leaf is a permissions page 2710 or a pagedirectory 2603.

In operation, the OS sets the CR3 register 1301 to the root pagingstructure and this handles all the shared memory mappings. The PIT 2300will hold a list of sub-process paging structures, that defer to theroot paging structure. The index into the PIT 2300 is set by the newuser space instruction (SWITCHSP) or may be set by the kernel (or otherprivileged software component).

In one embodiment, invoking a far branch to the new PCID as describedabove causes the process to switch to the sub-process index register.The subprocess PCID address space ID (ASID) tags are then used in theTLB, including the data TLB (dTLB) and instruction TLB (iTLB). However,in one implementation, ASID tags are optional, and may be used on someTLBs and not others within a given processor. Note that the iTLB can beglobal across subprocesses as the memory mappings and executable codepaths do not need to change. The control flow may be verified usingendbranch/DAV branch target instructions (specifying a valid sub processentry point) and the subprocess permissions paging structure for thedestination subprocess will be walked on a TLB miss (e.g., whenaccessing data in the destination subprocess). The current PCID indexcan be read as well to verify access control permissions when entering asubprocess, where there is an index register to store the caller's PCIDindex for access control verification. This improves the security of themodel as well, enabling a callee sub-process to verify the callersub-process within the super-process.

One embodiment of the invention includes optimized TLB management.Because the PIT paging structures refer to permission pages only, theiTLB can be shared, and treated as a global resource. The data TLB canbe tagged with the PCID and/or other address space ID translation asdescribed above. Furthermore, the dTLB can be partitioned into a memorytranslation TLB based on the root CR3 being the tag identifier, wherethe PCID permission table is a substructure used to cache thepermissions of a permission table for that root CR3.

The embodiments of the invention described above provide numerousbenefits over existing systems including improvements to memory savings,performance, scalability, and security. In particular, the super-processpaging structure is fully populated while sub-process paging structuresonly contain the deltas, thus saving memory over reproducing redundantpaging structures across different processes. Meanwhile, Heap and Stackstructures as well as code may be shared across all sub-processes, withonly changes to permissions depending on the current sub-process on apage-by-page basis.

Moreover, because of the ring-3 sub-process switching described above,latency is improved over today's process switching which requires a ringtransition, a MOV CR3 instruction, followed by another ring transition.Further optimizations such as sharing the iTLB across sub-processes andadditional ASIDs may further improve performance.

With respect to scalability, thousands of subprocesses are enabled.Because there is a super-process paging structure, all page remappingupdates can be done to this one base paging structure without the needto change all subprocesses paging structures. This way only one pagingstructure update needs be done and not thousands when paging in and outto storage. Also, because additional address space is not consumed inthe paging structures (as with protection keys), all available addressspace may be used.

Finally, because these embodiments still implement address spaceisolation, any side channel protections that may be in place forseparate address spaces may still apply. A new ENDBRANCH instructionidentifying endpoints to subprocesses and caller subprocessidentification also allows efficient access control acrosssub-processes.

Some embodiments may include accessed and dirty bits in PIT pagingstructures in addition to the accessed and dirty bits in CR3-based pagetables. The processor may update the accessed and dirty bits in just thePIT paging structures or CR3-based page tables that were used togenerate an address mapping, or it may update the accessed and dirtybits in any paging structure entry or page table entry that correspondsto the linear address being accessed.

In the foregoing specification, the embodiments of invention have beendescribed with reference to specific exemplary embodiments thereof. Itwill, however, be evident that various modifications and changes may bemade thereto without departing from the broader spirit and scope of theinvention as set forth in the appended claims. The specification anddrawings are, accordingly, to be regarded in an illustrative rather thana restrictive sense.

Examples

The following are example implementations of different embodiments ofthe invention.

Example 1

A processor comprising: execution circuitry to execute instructions andprocess data; memory management circuitry coupled to the executioncircuitry, the memory management circuitry to manage access to a systemmemory by a plurality of related processes using one or moreprocess-specific translation structures and one or more sharedtranslation structures to be shared by the related processes; and one ormore control registers to store a process-specific base address pointerassociated with a first process of the plurality of related processesand to store a shared base address pointer to identify the sharedtranslation structures; wherein the memory management circuitry is touse the process-specific base address pointer in combination with afirst linear address provided by the first process to walk theprocess-specific translation structures to identify any permissionsand/or physical address associated with the first linear address,wherein when permissions are identified, the memory management circuitryis to use the permissions in place of any permissions specified in theshared translation structures.

Example 2

The processor of example 1 wherein the one or more control registerscomprise: a first control register to store the process-specific baseaddress pointer associated with a first process of the plurality ofrelated processes; and a second control register to store the sharedbase address pointer to identify the shared translation structures.

Example 3

The processor of example 1 further comprising: a translation lookasidebuffer (TLB) to store a plurality of address translation entriescomprising mappings of linear addresses to physical addresses, one ormore of the address translation entries to be associated with the firstprocess based on a process identification field included in the one ormore address translation entries.

Example 4

The processor of example 3 wherein the memory management circuitry is toinitially query the TLB to determine when any entry exists for the firstlinear address and is to walk the process-specific translationstructures only when no TLB entry for the first linear address is found.

Example 5

The processor of example 4 wherein the memory management circuitry is toupdate the TLB with an entry including the physical address and/orpermissions resulting from the walk of the process-specific translationstructures.

Example 6

The processor of example 1 wherein when permissions are not found in theprocess-specific translation structures, the memory management circuitryis to use the shared base address pointer and the first linear addressto walk the shared translation structures to identify shared permissionsassociated with the first linear address and to use the sharedpermissions to manage access to the physical address associated with thefirst linear address.

Example 7

The processor of example 6 wherein when permissions are identified inthe process-specific translation structure but the physical address isnot identified, the memory management circuitry is to walk the sharedtranslation structures to determine the physical address associated withthe first linear address and is to use the permissions to manage accessto the physical address.

Example 8

The processor of example 7 wherein the process-specific translationstructure is to specify the permissions at a higher level of granularitythan the shared translation structures such that the memory managementcircuitry is to apply the permissions to region of the sharedtranslation structures indicated by the granularity.

Example 9

The processor of example 8 wherein the shared translation structurescomprise a hierarchical arrangement of translation tables and whereinthe permissions are applied to a first table and all other tables and/orentries under the first table in the hierarchical arrangement.

Example 10

The processor of example 1 wherein the plurality of related processesare related as a super-process by an operating system or managementcomponent.

Example 11

A method comprising: executing a plurality of related processes usingone or more process-specific translation structures and one or moreshared translation structures to be shared by the related processes; andstoring a process-specific base address pointer associated with a firstprocess of the plurality of related processes in one or more controlregisters; storing a shared base address pointer to identify the sharedtranslation structures in the one or more control registers; walking theprocess-specific translation structures using the process-specific baseaddress pointer in combination with a first linear address provided bythe first process to identify any permissions and/or physical addressassociated with the first linear address; and using the permissions,when identified, in place of any permissions specified in the sharedtranslation structures.

Example 12

The method of example 11 wherein the one or more control registerscomprise: a first control register to store the process-specific baseaddress pointer associated with a first process of the plurality ofrelated processes; and a second control register to store the sharedbase address pointer to identify the shared translation structures.

Example 13

The method of example 11 further comprising: a translation lookasidebuffer (TLB) to store a plurality of address translation entriescomprising mappings of linear addresses to physical addresses, one ormore of the address translation entries to be associated with the firstprocess based on a process identification field included in the one ormore address translation entries.

Example 14

The method of example 13 wherein the memory management circuitry is toinitially query the TLB to determine when any entry exists for the firstlinear address and is to walk the process-specific translationstructures only of no TLB entry for the first linear address is found.

Example 15

The method of example 14 wherein the memory management circuitry is toupdate the TLB with an entry including the physical address and/orpermissions resulting from the walk of the process-specific translationstructures.

Example 16

The method of example 11 wherein when permissions are not found in theprocess-specific translation structures, the memory management circuitryis to use the shared base address pointer and the first linear addressto walk the shared translation structures to identify shared permissionsassociated with the first linear address and to use the sharedpermissions to manage access to the physical address associated with thefirst linear address.

Example 17

The method of example 16 wherein when permissions are identified in theprocess-specific translation structure but the physical address is notidentified, the memory management circuitry is to walk the sharedtranslation structures to determine the physical address associated withthe first linear address and is to use the permissions to manage accessto the physical address.

Example 18

The method of example 17 wherein the process-specific translationstructure is to specify the permissions at a higher level of granularitythan the shared translation structures such that the memory managementcircuitry is to apply the permissions to region of the sharedtranslation structures indicated by the granularity.

Example 19

The method of example 18 wherein the shared translation structurescomprise a hierarchical arrangement of translation tables and whereinthe permissions are applied to a first table and all other tables and/orentries under the first table in the hierarchical arrangement.

Example 20

The processor of example 11 wherein the plurality of related processesare related as a super-process by an operating system or managementcomponent.

Embodiments of the invention may include various steps, which have beendescribed above. The steps may be embodied in machine-executableinstructions which may be used to cause a general-purpose orspecial-purpose processor to perform the steps. Alternatively, thesesteps may be performed by specific hardware components that containhardwired logic for performing the steps, or by any combination ofprogrammed computer components and custom hardware components.

As described herein, instructions may refer to specific configurationsof hardware such as application specific integrated circuits (ASICs)configured to perform certain operations or having a predeterminedfunctionality or software instructions stored in memory embodied in anon-transitory computer readable medium. Thus, the techniques shown inthe Figures can be implemented using code and data stored and executedon one or more electronic devices (e.g., an end station, a networkelement, etc.). Such electronic devices store and communicate(internally and/or with other electronic devices over a network) codeand data using computer machine-readable media, such as non-transitorycomputer machine-readable storage media (e.g., magnetic disks; opticaldisks; random access memory; read only memory; flash memory devices;phase-change memory) and transitory computer machine-readablecommunication media (e.g., electrical, optical, acoustical or other formof propagated signals—such as carrier waves, infrared signals, digitalsignals, etc.). In addition, such electronic devices typically include aset of one or more processors coupled to one or more other components,such as one or more storage devices (non-transitory machine-readablestorage media), user input/output devices (e.g., a keyboard, atouchscreen, and/or a display), and network connections. The coupling ofthe set of processors and other components is typically through one ormore busses and bridges (also termed as bus controllers). The storagedevice and signals carrying the network traffic respectively representone or more machine-readable storage media and machine-readablecommunication media. Thus, the storage device of a given electronicdevice typically stores code and/or data for execution on the set of oneor more processors of that electronic device. Of course, one or moreparts of an embodiment of the invention may be implemented usingdifferent combinations of software, firmware, and/or hardware.Throughout this detailed description, for the purposes of explanation,numerous specific details were set forth in order to provide a thoroughunderstanding of the present invention. It will be apparent, however, toone skilled in the art that the invention may be practiced without someof these specific details. In certain instances, well known structuresand functions were not described in elaborate detail in order to avoidobscuring the subject matter of the present invention. Accordingly, thescope and spirit of the invention should be judged in terms of theclaims which follow.

What is claimed is:
 1. A processor comprising: execution circuitry toexecute instructions and process data; memory management circuitrycoupled to the execution circuitry, the memory management circuitry tomanage access to a system memory by a plurality of related processesusing one or more process-specific translation structures and one ormore shared translation structures to be shared by the relatedprocesses; and one or more control registers to store a process-specificbase address pointer associated with a first process of the plurality ofrelated processes and to store a shared base address pointer to identifythe shared translation structures; wherein the memory managementcircuitry is to use the process-specific base address pointer incombination with a first linear address provided by the first process towalk the process-specific translation structures to identify anypermissions and/or physical address associated with the first linearaddress, wherein when permissions are identified, the memory managementcircuitry is to use the permissions in place of any permissionsspecified in the shared translation structures.
 2. The processor ofclaim 1 wherein the one or more control registers comprise: a firstcontrol register to store the process-specific base address pointerassociated with a first process of the plurality of related processes;and a second control register to store the shared base address pointerto identify the shared translation structures.
 3. The processor of claim1 further comprising: a translation lookaside buffer (TLB) to store aplurality of address translation entries comprising mappings of linearaddresses to physical addresses, one or more of the address translationentries to be associated with the first process based on a processidentification field included in the one or more address translationentries.
 4. The processor of claim 3 wherein the memory managementcircuitry is to initially query the TLB to determine when any entryexists for the first linear address and is to walk the process-specifictranslation structures only when no TLB entry for the first linearaddress is found.
 5. The processor of claim 4 wherein the memorymanagement circuitry is to update the TLB with an entry including thephysical address and/or permissions resulting from the walk of theprocess-specific translation structures.
 6. The processor of claim 1wherein when permissions are not found in the process-specifictranslation structures, the memory management circuitry is to use theshared base address pointer and the first linear address to walk theshared translation structures to identify shared permissions associatedwith the first linear address and to use the shared permissions tomanage access to the physical address associated with the first linearaddress.
 7. The processor of claim 6 wherein when permissions areidentified in the process-specific translation structure but thephysical address is not identified, the memory management circuitry isto walk the shared translation structures to determine the physicaladdress associated with the first linear address and is to use thepermissions to manage access to the physical address.
 8. The processorof claim 7 wherein the process-specific translation structure is tospecify the permissions at a higher level of granularity than the sharedtranslation structures such that the memory management circuitry is toapply the permissions to region of the shared translation structuresindicated by the granularity.
 9. The processor of claim 8 wherein theshared translation structures comprise a hierarchical arrangement oftranslation tables and wherein the permissions are applied to a firsttable and all other tables and/or entries under the first table in thehierarchical arrangement.
 10. The processor of claim 1 wherein theplurality of related processes are related as a super-process by anoperating system or management component.
 11. A method comprising:executing a plurality of related processes using one or moreprocess-specific translation structures and one or more sharedtranslation structures to be shared by the related processes; andstoring a process-specific base address pointer associated with a firstprocess of the plurality of related processes in one or more controlregisters; storing a shared base address pointer to identify the sharedtranslation structures in the one or more control registers; walking theprocess-specific translation structures using the process-specific baseaddress pointer in combination with a first linear address provided bythe first process to identify any permissions and/or physical addressassociated with the first linear address; and using the permissions,when identified, in place of any permissions specified in the sharedtranslation structures.
 12. The method of claim 11 wherein the one ormore control registers comprise: a first control register to store theprocess-specific base address pointer associated with a first process ofthe plurality of related processes; and a second control register tostore the shared base address pointer to identify the shared translationstructures.
 13. The method of claim 11 further comprising: a translationlookaside buffer (TLB) to store a plurality of address translationentries comprising mappings of linear addresses to physical addresses,one or more of the address translation entries to be associated with thefirst process based on a process identification field included in theone or more address translation entries.
 14. The method of claim 13wherein the memory management circuitry is to initially query the TLB todetermine when any entry exists for the first linear address and is towalk the process-specific translation structures only of no TLB entryfor the first linear address is found.
 15. The method of claim 14wherein the memory management circuitry is to update the TLB with anentry including the physical address and/or permissions resulting fromthe walk of the process-specific translation structures.
 16. The methodof claim 11 wherein when permissions are not found in theprocess-specific translation structures, the memory management circuitryis to use the shared base address pointer and the first linear addressto walk the shared translation structures to identify shared permissionsassociated with the first linear address and to use the sharedpermissions to manage access to the physical address associated with thefirst linear address.
 17. The method of claim 16 wherein if permissionsare identified in the process-specific translation structure but thephysical address is not identified, the memory management circuitry isto walk the shared translation structures to determine the physicaladdress associated with the first linear address and is to use thepermissions to manage access to the physical address.
 18. The method ofclaim 17 wherein the process-specific translation structure is tospecify the permissions at a higher level of granularity than the sharedtranslation structures such that the memory management circuitry is toapply the permissions to region of the shared translation structuresindicated by the granularity.
 19. The method of claim 18 wherein theshared translation structures comprise a hierarchical arrangement oftranslation tables and wherein the permissions are applied to a firsttable and all other tables and/or entries under the first table in thehierarchical arrangement.
 20. The processor of claim 11 wherein theplurality of related processes are related as a super-process by anoperating system or management component.